Document Type
Lecture
Publication Date
9-9-2015
Abstract
Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide range of higher level operations and thus being critical to the overall network design. A distinct feature of WSNs is that many nodes alternate between active and dormant states, so as to conserve energy and extend the network lifetime. Unfortunately, the impact of such cycles has been largely ignored in existing broadcast implementations that adopt the common assumption of all nodes being active all over the time. In this talk, we revisit the broadcast problem with active/dormant cycles. We show strong evidence that conventional broadcast approaches will su er from severe performance degradation, and, under low duty cycles, they could easily fail to cover the whole network in an acceptable time frame. To this end, we remodel the broadcast problem in this new context, seeking a balance between e ciency and latency with coverage guarantees. We demonstrate that this problem can be translated into a graph equivalence, and develop a centralized optimal solution. It provides a valuable benchmark for assessing diverse duty-cycle-aware broadcast strategies. We then extend it to an e cient and scalable distributed implementation, which relies on local information and operations only, with built-in loss compensation mechanisms. The performance of our solution is evaluated under diverse network con gurations. The results suggest that our distributed solution is close to the lower bounds of both time and forwarding costs, and it well resists to the wireless loss with good scalability on the network size and density. In addition, it enables exible control toward the quality of broadcast coverage.
Relational Format
presentation
Recommended Citation
Wang, Feng, "On Reliable Broadcast in Low Duty-Cycle Wireless Sensor Networks" (2015). Combinatorics Seminar. 35.
https://egrove.olemiss.edu/math_combinatorics/35
