ACM Trans. Sens. Networks最新文献_第6页

DutyCon: A dynamic duty-cycle control approach to end-to-end delay guarantees in wireless sensor networks 在无线传感器网络中实现端到端时延保证的动态占空比控制方法

ACM Trans. Sens. Networks Pub Date : 2013-07-01 DOI: 10.1145/2489253.2489259

Xiaodong Wang, Xiaorui Wang, Liu Liu, G. Xing

{"title":"DutyCon: A dynamic duty-cycle control approach to end-to-end delay guarantees in wireless sensor networks","authors":"Xiaodong Wang, Xiaorui Wang, Liu Liu, G. Xing","doi":"10.1145/2489253.2489259","DOIUrl":"https://doi.org/10.1145/2489253.2489259","url":null,"abstract":"It is well known that periodically putting nodes into sleep can effectively save energy in wireless sensor networks at the cost of increased communication delays. However, most existing work mainly focuses on the static sleep scheduling, which cannot guarantee the desired delay when the network conditions change dynamically. In many applications with user-specified end-to-end delay requirements, the duty cycle of every node should be tuned individually at runtime based on the network conditions to achieve the desired end-to-end delay guarantees and energy efficiency. In this article, we propose DutyCon, a control theory-based dynamic duty-cycle control approach. DutyCon decomposes the end-to-end delay guarantee problem into a set of single-hop delay guarantee problems along each data flow in the network. We then formulate the single-hop delay guarantee problem as a dynamic feedback control problem and design the controller rigorously, based on feedback control theory, for analytic assurance of control accuracy and system stability. DutyCon also features a queuing delay adaptation scheme that adapts the duty cycle of each node to unpredictable incoming packet rates, as well as a novel energy-balancing approach that extends the network lifetime by dynamically adjusting the delay requirement allocated to each hop. Our empirical results on a hardware testbed demonstrate that DutyCon can effectively achieve the desired trade-off between end-to-end delay and energy conservation. Extensive simulation results also show that DutyCon outperforms two baseline sleep scheduling protocols by having more energy savings while meeting the end-to-end delay requirements.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117350820","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}

引用次数: 19

On the quality and value of information in sensor networks 论传感器网络中信息的质量和价值

ACM Trans. Sens. Networks Pub Date : 2013-07-01 DOI: 10.1145/2489253.2489265

C. Bisdikian, Lance M. Kaplan, M. Srivastava

引用次数: 130

Performance evaluation of sensor networks by statistical modeling and euclidean model checking 基于统计建模和欧几里得模型检验的传感器网络性能评价

ACM Trans. Sens. Networks Pub Date : 2013-07-01 DOI: 10.1145/2489253.2489256

YoungMin Kwon, G. Agha

{"title":"Performance evaluation of sensor networks by statistical modeling and euclidean model checking","authors":"YoungMin Kwon, G. Agha","doi":"10.1145/2489253.2489256","DOIUrl":"https://doi.org/10.1145/2489253.2489256","url":null,"abstract":"Modeling and evaluating the performance of large-scale wireless sensor networks (WSNs) is a challenging problem. The traditional method for representing the global state of a system as a cross product of the states of individual nodes in the system results in a state space whose size is exponential in the number of nodes. We propose an alternative way of representing the global state of a system: namely, as a probability mass function (pmf) which represents the fraction of nodes in different states. A pmf corresponds to a point in a Euclidean space of possible pmf values, and the evolution of the state of a system is represented by trajectories in this Euclidean space. We propose a novel performance evaluation method that examines all pmf trajectories in a dense Euclidean space by exploring only finite relevant portions of the space. We call our method Euclidean model checking. Euclidean model checking is useful both in the design phase—where it can help determine system parameters based on a specification—and in the evaluation phase—where it can help verify performance properties of a system. We illustrate the utility of Euclidean model checking by using it to design a time difference of arrival (TDoA) distance measurement protocol and to evaluate the protocol's implementation on a 90-node WSN. To facilitate such performance evaluations, we provide a Markov model estimation method based on applying a standard statistical estimation technique to samples resulting from the execution of a system.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924157","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}

引用次数: 9

Adaptive energy-efficient scheduling for hierarchical wireless sensor networks 分层无线传感器网络的自适应节能调度

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480736

Wei Li, Flávia Coimbra Delicato, Albert Y. Zomaya

{"title":"Adaptive energy-efficient scheduling for hierarchical wireless sensor networks","authors":"Wei Li, Flávia Coimbra Delicato, Albert Y. Zomaya","doi":"10.1145/2480730.2480736","DOIUrl":"https://doi.org/10.1145/2480730.2480736","url":null,"abstract":"Most Wireless Sensor Network (WSN) applications require distributed signal and collaborative data processing. One of the critical issues for enabling collaborative processing in WSNs is how to schedule tasks in a systematic way, including assigning tasks to sensor nodes, and determining their execution and communication sequence. Since WSN nodes are very resource constrained, mainly regarding their energy supply, one major concern when scheduling tasks in such environments is to minimize and balance the energy consumption, so that the system operational lifetime is maximized. We propose a heuristic-based three-phase algorithm (TPTS) for allocating tasks to multiple clusters in hierarchical WSNs that aims at finding a scheduling scheme that minimizes the overall energy consumption and balances the workload of the system while meeting the application's deadline. The performance of the proposed algorithm and the effect of several parameters on its behavior were evaluated by simulations, with promising results. The experimental results show that the time and energy performance of TPTS are close to the time and energy of benchmarks in most cases, while load balance is always provided.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129950491","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}

引用次数: 38

Distributed and compact routing using spatial distributions in wireless sensor networks 无线传感器网络中使用空间分布的分布式和紧凑路由

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480735

Rik Sarkar, Xianjin Zhu, Jie Gao

{"title":"Distributed and compact routing using spatial distributions in wireless sensor networks","authors":"Rik Sarkar, Xianjin Zhu, Jie Gao","doi":"10.1145/2480730.2480735","DOIUrl":"https://doi.org/10.1145/2480730.2480735","url":null,"abstract":"In traditional routing, the routing tables store shortest paths to all other destinations and have size linear in the size of the network, which is not scalable for resource-constrained networks such as wireless sensor networks. In this article we show that by storing selectively a much smaller set of routing paths in the routing tables one can get low-stretch, compact routing schemes.\u0000 Our routing scheme includes an approximate distance oracle with which one can obtain approximate shortest path length estimates to destinations. This distance oracle can be obtained, for example, by a landmark-based scheme, or in case of sensor networks, from the geographic distance between node locations. With an approximate distance oracle one can attempt greedy routing by forwarding to the neighbor whose estimate is closer to the destination. But there is no guarantee of delivery nor of the routing path length. We augment the distance oracle by storing, for each node u, routing paths to O(log2 n) strategically selected nodes that serve as intermediate destinations. These nodes are selected with probability proportional to 1/rρ, where r is the distance to u and ρ is a suitable constant for the network. Then we derive a set of sufficient conditions to select the next step at each stage of routing, such that these conditions can be verified locally and guarantee 1+ϵ stretch routing on any metric. These conditions serve as the “greedy routing” or local decision rule.\u0000 On graphs of bounded growth, our scheme guarantees 1+ϵ stretch routing with high probability, with an average routing table size of O(√n log2 n). This scheme is favorable for its simplicity, generality, and blindness to any global state. It demonstrates that global routing properties could emerge from purely distributed and uncoordinated routing table design.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130311950","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

Energy-efficient data dissemination using beamforming in wireless sensor networks 无线传感器网络中基于波束形成的高能效数据传播

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480734

Jing Feng, Lu Yung-Hsiang, B. Jung, D. Peroulis, HU Y.CHARLIE

{"title":"Energy-efficient data dissemination using beamforming in wireless sensor networks","authors":"Jing Feng, Lu Yung-Hsiang, B. Jung, D. Peroulis, HU Y.CHARLIE","doi":"10.1145/2480730.2480734","DOIUrl":"https://doi.org/10.1145/2480730.2480734","url":null,"abstract":"Energy conservation is essential in Wireless Sensor Networks (WSNs) because of limited energy in nodes' batteries. Collaborative beamforming uses multiple transmitters to form antenna arrays; the electromagnetic waves from these antenna arrays can create constructive interferences at the receiver and increase the transmission distance. Each transmitter can use lower power and save energy, since the energy consumption is spread over multiple transmitters. Each beamforming transmission requires multiple collaborative transmitters. Repetitively using the same transmitters will deplete their energy and create coverage holes in the sensing area. To prevent holes, energy should be balanced by using different transmitters. This article investigates the factors that can affect the energy consumption and network lifetime when using beamforming. We present an algorithm for selecting the transmitters in order to prolong the network lifetime. Compared with an existing beamforming transmitters scheduling algorithm, our algorithm doubles the network lifetime. When compared with direct transmission or multihop transmissions towards a receiver far away from the sensing area, our approach can increase the network's lifetime substantially.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"121 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131746640","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}

引用次数: 18

Enhancing RSSI-based tracking accuracy in wireless sensor networks 提高无线传感器网络中基于rssi的跟踪精度

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480732

Gaddi Blumrosen, Bracha Hod, T. Anker, D. Dolev, B. Rubinsky

引用次数: 65

Real-time routing in wireless sensor networks: A potential field approach 无线传感器网络中的实时路由:一种势场方法

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480738

Yinsheng Xu, Fengyuan Ren, Tao He, Chuang Lin, Canfeng Chen, Sajal K. Das

引用次数: 32

System-level calibration for data fusion in wireless sensor networks 无线传感器网络中数据融合的系统级校准

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480731

R. Tan, G. Xing, Zhaohui Yuan, Xue Liu, Jianguo Yao

{"title":"System-level calibration for data fusion in wireless sensor networks","authors":"R. Tan, G. Xing, Zhaohui Yuan, Xue Liu, Jianguo Yao","doi":"10.1145/2480730.2480731","DOIUrl":"https://doi.org/10.1145/2480730.2480731","url":null,"abstract":"Wireless sensor networks are typically composed of low-cost sensors that are deeply integrated in physical environments. As a result, the sensing performance of a wireless sensor network is inevitably undermined by biases in imperfect sensor hardware and the noises in data measurements. Although a variety of calibration methods have been proposed to address these issues, they often adopt the device-level approach that becomes intractable for moderate-to large-scale networks. In this article, we propose a two-tier system-level calibration approach for a class of sensor networks that employ data fusion to improve the sensing performance. In the first tier of our calibration approach, each sensor learns its local sensing model from noisy measurements using an online algorithm and only transmits a few model parameters. In the second tier, sensors' local sensing models are then calibrated to a common system sensing model. Our approach fairly distributes computation overhead among sensors and significantly reduces the communication overhead of calibration compared with the device-level approach. Based on this approach, we develop an optimal model calibration scheme that maximizes the target detection probability of a sensor network under bounded false alarm rate. Our approach is evaluated by both experiments on a testbed of TelosB motes and extensive simulations based on synthetic datasets as well as data traces collected in a real vehicle detection experiment. The results demonstrate that our system-level calibration approach can significantly boost the detection performance of sensor networks in scenarios with low signal-to-noise ratios.","PeriodicalId":263540,"journal":{"name":"ACM Trans. Sens. Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128596914","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}

引用次数: 40

Property management in wireless sensor networks with overcomplete radon bases 超完备氡基无线传感器网络中的物业管理

ACM Trans. Sens. Networks Pub Date : 2013-05-01 DOI: 10.1145/2480730.2480739

Xiaoye Jiang, Mo Li, Y. Yao, L. Guibas

引用次数: 0