Abstract

Flooding is a fundamental, critical, and indispensable operation to support various applications and protocols in wireless ad hoc networks. The traditional flooding scheme generates excessive redundant packet retransmissions, causing contention and packet collisions, and ultimately wasting limited bandwidth and energy. Some recent flooding schemes that avoid those problems have been studied. They can achieve local optimality and have lower computational complexity. However, drawbacks limit the efficiency of these schemes. In this paper, we propose an efficient flooding protocol that minimizes flooding traffic, leveraging location information of 1-hop neighbor nodes. Our scheme is receiver-based; it does not piggyback any neighbor information. We prove theoretically that the proposed scheme achieves 100 percent deliverability. Simulation shows our scheme to be highly efficient. It consumes less energy, reduces the number of forwarding nodes almost to that of the benchmark, but maintains a high delivery ratio.

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

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.