IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.最新文献_第5页

An RPC design for wireless sensor networks 无线传感器网络的RPC设计

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1108/17427370780000168

T. May, S. Dunning, George A. Dowding, J. Hallstrom

{"title":"An RPC design for wireless sensor networks","authors":"T. May, S. Dunning, George A. Dowding, J. Hallstrom","doi":"10.1108/17427370780000168","DOIUrl":"https://doi.org/10.1108/17427370780000168","url":null,"abstract":"Wireless sensor networks (WSNs) will profoundly influence the ubiquitous computing landscape. Their utility derives not from the computational capabilities of any single sensor node, but from the emergent capabilities of many communicating sensor nodes. Consequently, the details of communication within and across single hop neighborhoods is a fundamental component of most WSN applications. But these details are often complex, and popular embedded languages for WSNs do not provide suitable communication abstractions. We propose that the absence of such abstractions contributes to the difficulty of developing large-scale WSN applications. To address this issue, we present the design and implementation of a remote procedure call (RPC) abstraction for nesC and TinyOS, the defacto standard for developing WSN applications. We present the key language extensions, operating system services, and automation tools that enable the proposed abstraction. We illustrate these contributions in the context of a small case study, and draw preliminary conclusions regarding the suitably of our approach to resource-constrained sensor nodes","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124902874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 35

Resource allocation using multiple edge-sharing multicast trees 利用多边共享组播树进行资源分配

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542821

Abhishek P. Patil, A. Esfahanian, Li Xiao, Yunhao Liu

引用次数: 3

Publish-subscribe on sensor networks: a semi-probabilistic approach 传感器网络上的发布-订阅:半概率方法

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542816

Paolo Costa, G. Picco, Silvana Rossetto

引用次数: 52

Cooperation enforcement in ad hoc networks with penalty 特设网络的合作执法与处罚

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542794

D. Qian, Chi Zhou, Jinsong Zhang

{"title":"Cooperation enforcement in ad hoc networks with penalty","authors":"D. Qian, Chi Zhou, Jinsong Zhang","doi":"10.1109/MAHSS.2005.1542794","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542794","url":null,"abstract":"To facilitate the multi-hop communications in mobile ad hoc networks, all the nodes in the networks need to cooperate and relay packets for other nodes. Unfortunately, there exist selfish nodes that may refuse to relay packets for others in order to save their own resources such as energy. Those non-cooperative behaviors will lower down the network performance significantly. Therefore, schemes need to be developed to enforce the cooperation of selfish nodes in the multi-hop communications. Credit-based algorithms have been proposed and are considered simple and effective. However, those schemes can lead to unbalanced credit distribution. That is, some nodes in hot areas can easily gain many credits so that they stop relaying for others, while some nodes in cold areas may gain few credits so that they are excluded from the network even if they are willing to cooperate. This paper aims to provide a solution to encourage the nodes in hot areas to stay in the network and help others relay the traffic. We impose a penalty for those non-cooperative nodes in order to force them to participate the communications. To further provide incentive for cooperative nodes to remain cooperative, we propose a game played by the nodes in the same layer. The imposed penalty depends on the outcome of the game. When a node chooses cooperation, the payoff it perceives is the reward from relay minus the cost resulting from the energy loss. When a node chooses not to cooperate, the payoff is the penalty. A node will select the option that generates larger payoff. Simulation results show that our scheme can enforce the nodes in hot areas to cooperate and also encourage cooperative nodes to remain cooperative","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116992022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Energy-efficient self-adapting online linear forecasting for wireless sensor network applications 无线传感器网络节能自适应在线线性预测

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542822

Jai-Jin Lim, K. Shin

引用次数: 7

Improved transport service for remote sensing and control over wireless networks 提高无线遥感控制传输服务水平

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542817

Zhiwei Cen, M. Mutka, Danyu Zhu, N. Xi

{"title":"Improved transport service for remote sensing and control over wireless networks","authors":"Zhiwei Cen, M. Mutka, Danyu Zhu, N. Xi","doi":"10.1109/MAHSS.2005.1542817","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542817","url":null,"abstract":"In a bilateral teleoperated system, the signal transmissions between the operator and the slave manipulators have different QoS requirements in comparison to traditional network traffic. Running teleoperated systems over wireless networks poses more challenges in comparison to wired networks. The media streams involved differentiate themselves from other media types in that they require both reliable and smooth delivery. Reliable delivery requires the transport service to have TCP style semantics. By being smooth, the transport service should be able to deliver the control and sensing data with bounded and reduced latency and its variation. For example, we have conducted numerous teleoperated experiments using our system. We have found in some of our applications that if the end-to-end latency variance becomes larger than 0.3 second, the operator has difficulty maintaining smooth control of the slave manipulator. However, our simulations show that using TCP, the end-to-end latency variance can be as much as 2.5 seconds in an ad hoc wireless network. This paper proposes an improved transport service for remote sensing and control (TRSC). The service reduces the end-to-end latency and latency variance (jitter) for real-time reliable media in mobile ad hoc networks by using forward error correction encoding and multiple network paths. Simulation using NS2 shows the approach performs well under different wireless scenarios","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123341669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Distortion sum-rate performance of successive coding strategy in Gaussian wireless sensor networks 高斯无线传感器网络中连续编码策略的失真和率性能

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542826

H. Behroozi, M. Soleymani

{"title":"Distortion sum-rate performance of successive coding strategy in Gaussian wireless sensor networks","authors":"H. Behroozi, M. Soleymani","doi":"10.1109/MAHSS.2005.1542826","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542826","url":null,"abstract":"In this paper, we investigate the distortion sum-rate performance of the successive coding strategy in the so-called quadratic Gaussian CEO problem. In the CEO problem, the central unit or the CEO desires to obtain an optimal estimate of the source signal. Since the source cannot be observed directly, L sensors will be deployed to observe independently corrupted versions of the source. They communicate information about their observations to the CEO through rate constrained noiseless channels without cooperating with each other. We consider a distributed sensor network consisting of two sensors with different noise levels and derive the minimum achievable distortion under a sum-rate constraint using the successive coding strategy of S.C. Draper and G.W. Wornell (2004). We also demonstrate that the best way to achieve minimum distortion under a sum-rate constraint is to allocate more rate to the sensor with higher quality of observation in a generalized water-filling manner. The fractional rate allocation is approximately 1/2 if the sum-rate lowbarR is large. Thus, we can simplify rate allocation problem in a general parallel sensor network with L sensors by assigning equal rates to sensors, provided the average rate per sensor node is large. We show that this scheme may not cause a large extra distortion compared with the minimum achievable distortion. Finally, we consider the problem of combining source and channel coding in sensor networks. Two paradigms are considered, Shannon's separation paradigm and joint source-channel coding paradigm. We obtain the distortion-power tradeoffs for both coding paradigms in the Gaussian sensor network with multiple access channel","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115187611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Towards a new communication paradigm for mobile ad hoc networks 面向移动自组织网络的新通信范式

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542776

Vincent Lenders, M. May, B. Plattner

{"title":"Towards a new communication paradigm for mobile ad hoc networks","authors":"Vincent Lenders, M. May, B. Plattner","doi":"10.1109/MAHSS.2005.1542776","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542776","url":null,"abstract":"In mobile ad hoc networks, we envision a network where mobile users obtain services from close-by instances. The architecture of today's Internet was designed for fixed users that obtain services from stationary servers and is not well suited for such scenarios. The reason is that (i) the architecture combines identity and location in an IP address and thus forces mobile elements to change their identity when moving over subnet boundaries; and that (ii) the layered architecture implies a separation of service discovery/selection and routing, which is inflexible and also leads to protocol overhead. In this paper, we revise the existing Internet architecture and propose a novel architecture that is better suited for mobile ad hoc networks. There, clients bind to location-independent service identifiers and send packets that are routed to any instance of the desired service in proximity. The routing mechanism is based on the concept of (electrical) fields with which packets are forwarded towards a region with a high density of service nodes. As a result, this architecture increases the probability of successful packet delivery and leads to a robust routing substrate even in very unstable network conditions","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132550748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Redundant source routing for real-time services in ad hoc networks

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542778

Lei Wang, S. Jang, Taedong Lee

引用次数: 13

An underlay for sensor networks: localized protocols for maintenance and usage 传感器网络的基础:维护和使用的本地化协议

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542837

Christo Frank Devaraj, Indranil Gupta, Mahwish Nagda, G. Agha

{"title":"An underlay for sensor networks: localized protocols for maintenance and usage","authors":"Christo Frank Devaraj, Indranil Gupta, Mahwish Nagda, G. Agha","doi":"10.1109/MAHSS.2005.1542837","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542837","url":null,"abstract":"We propose localized and decentralized protocols to construct and maintain an underlay for sensor networks. An underlay lies in between overlay operations (e.g., data indexing, multicast, etc.) and the sensor network itself. Specifically, an underlay bridges the gap between (a) the unreliability of sensor nodes and communication and availability of only approximate location knowledge, and (b) the maintenance of a virtual geography-based naming structure that is required by several overlay operations. Our underlay creates a coarse naming scheme based on approximate location knowledge, and then maintains it in an efficient and scalable manner. The underlay naming can be used to specify arbitrary regions. The overlay operations that can be executed on the underlay include routing, aggregation, multicast, data indexing, etc. These overlay operations could be region-based. The proposed underlay maintenance protocols are robust, localized (hence scalable), energy and message efficient, have low convergence times, and provide tuning knobs to trade convergence time with overhead and with underlay uniformity. The maintenance protocols are mathematically analyzed by characterizing them as differential equation systems. We present microbenchmark results from a NesC implementation, and results from a large-scale simulation of a Java implementation. The latter experiments also show how routing using the underlay would perform","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115149185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2