Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links

By Shuo Guo, Yu Gu, Bo Jiang, Tian He. IEEE transactions on computers, 2009

301 citations recorded by the source corpus.

Flooding service has been investigated extensively in wireless networks to efficiently disseminate network-wide commands, configurations, and code binaries. However, little work has been done on low-duty-cycle wireless sensor networks in which nodes stay asleep most of the time and wake up asynchronously. In this type of network, a broadcasting packet is rarely received by multiple nodes simultaneously, a unique constraining feature that makes existing solutions unsuitable. In this paper, we introduce Opportunistic Flooding, a novel design tailored for low-duty-cycle networks with unreliable wireless links and predetermined working schedules. Starting with an energy-optimal tree structure, probabilistic forwarding decisions are made at each sender based on the delay distribution of next-hop receivers. Only opportunistically early packets are forwarded via links outside the tree to reduce the flooding delay and redundancy in transmission. We further propose a forwarder selection method to alleviate the hidden terminal problem and a link-quality-based backoff method to resolve simultaneous forwarding operations. We show by extensive simulations and test-bed implementations that Opportunistic Flooding is close to the optimal performance achievable by oracle flooding designs. Compared with Improved Traditional Flooding, our design achieves significantly shorter flooding delay while consuming only 20-60% of the transmission energy.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/89ac94db2f47e0469ceda64043abbab604cff2e4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, background): “In the random wakeup schedule [32], the system time is first partitioned into periods.”
Reputation-based incentive protocols in crowdsourcing applications (2011, background): “Finally and most importantly, the current pricing schemes cannot solve the social dilemma existing between workers and requesters: if the payment of a task is ex-ante, which means that the requester pays before the task starts, a worker always has the incentive to take the payment and provides no ef”