Abstract
Flooding is a fundamental function for the network-wide dissemination of command, query, and code update in wireless sensor networks. However, it is challenging to enable fast and energy-efficient flooding in sensor networks with low-duty cycles because it is rare that multiple neighboring nodes wake up at the same time, making broadcast instinct of wireless radio unavailable. The unreliability of wireless links deteriorates the situation. In this work, we study the delay-constrained flooding problem in order to disseminate data packets to all nodes within given expected delivery delay. In particular, a transmission power control–based flooding algorithm is proposed to reduce the flooding delay in such low-duty-cycle sensor networks. According to the soft delay bound, each node can locally adjust its transmission power level. To alleviate transmission conflicts, the backoff method with transmission power adaptive mechanism has been proposed. Based on the large-scale simulations, we validate that our design can reduce flooding delay with small extra energy expenditure compared with conventional flooding schemes.
Highlights
Multihop flooding is a fundamental network functionality in large-scale wireless networks, in which data packets are sent out from one control center to spread throughout the whole field in a multihop way
Since our design is based on tree-based topology, we first construct a minimum spanning tree based on the expected flooding delay (EFD-MST)
As shown in the figure, more than 80% nodes can receive the packet within the bound jDj for delay-constrained flooding (DCF), while the time durations to cover the same number of nodes are 717, 890, and 1053 for OPPF, Minimum expected delay–based flooding (MEDF), and Minimum expected energy–based flooding (MEEF), respectively
Summary
Multihop flooding is a fundamental network functionality in large-scale wireless networks, in which data packets are sent out from one control center to spread throughout the whole field in a multihop way. In conventional networks, flooding algorithms are usually performed in a broadcasting or multicasting way by taking advantage of the broadcasting nature of wireless radio, that is, a single transmission could be heard and received by multiple neighbors within the sender’s communication range. Under low-duty-cycle model, nodes are set to switch between the active and the dormant states periodically. The ratio of active state over the whole period is referred to as duty cycle, which is usually extremely low (less than 1% work period) for energy conservation.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call