Abstract
Flooding in low duty-cycled wireless sensor networks suffers from a large transmission delay because a sender has to wait until a receiver becomes active to forward a packet. With the presence of unreliable radio links, the delay performance is even more severely degraded. In this article, we aim to reduce the flooding delay in low duty-cycled wireless sensor networks in relation to link unreliability. The key idea is to build a delay-sensitive flooding tree in which a node receives packet through the shortest path in terms of the total expected number of transmissions. In addition, the algorithm allows multiple senders to send through links outside of the tree if they can provide earlier expected delivery time. To give priorities to potential senders, we employ an energy-balancing mechanism which dynamically distributes the sending role among them. The mechanism not only makes sure senders start to acquire the channel at different times to prevent collisions but also lets them alternatively take turns based on residual energy, in order to lengthen network lifetime. Compared with the best known schemes, the proposed algorithm achieves up to 8% improvement in terms of flooding delay, energy consumption, and network lifetime.
Highlights
Wireless sensor networks (WSNs) are often deployed in a large scale, with hundreds to thousands of nodes
A handful of studies have focused on building an efficient flooding tree, where the packet is sent according to a parent–child relationship.[4,5,6,7]
We propose a tree-based flooding structure which aims to improve the flooding delay in WSNs consisting of unreliable links
Summary
Wireless sensor networks (WSNs) are often deployed in a large scale, with hundreds to thousands of nodes They use flooding as a primitive operation to update network parameters, code, or disseminate a route discovery message to each node.[1,2,3] A pure flooding is when a node receives a packet and sends the packet to all neighboring nodes, except the one from which it received. This method results in redundant transmissions, since multiple nodes may transmit to a common neighbor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Distributed Sensor Networks
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.