Abstract
A neighbor knowledge-based broadcast scheme is proposed to reduce the latency for wireless ad hoc networks, yet keeping the overhead at a reasonably low level and fulfilling the reliability. In the scheme, few Hello messages are interchanged to collect one-hop neighbor information. The collected information is used to calculate the neighbor density, the ratio, and the number of one-hop uncovered neighbors, upon which the rebroadcast probability and delay are adjusted adaptively. The way that the rebroadcast probability and delay are defined in neighbor knowledge-based broadcast scheme reduces the transmission overhead and restrains the traffic aggregation effectively. Next, a velocity-based data distribution mechanism is proposed and extended to neighbor knowledge-based broadcast scheme to further reduce the latency, forming neighbor knowledge and velocity-based broadcast scheme. It is stipulated that few higher-velocity nodes are employed with bigger probability to rebroadcast the incoming message. The p...
Highlights
Broadcasting is a communication primitive in wireless ad hoc networks
The velocity-based data distribution mechanism and neighbor knowledge and velocity-based broadcast (NKVB) scheme are presented in section ‘‘NKVB scheme.’’ Performance evaluation of neighbor knowledge-based broadcast (NKB) and NKVB schemes by simulations in the context of wireless ad hoc networks is presented in section ‘‘Performance evaluation.’’ section ‘‘Conclusion’’ concludes the article
In NKB scheme, we focus on defining the rebroadcast delay and the rebroadcast probability more reasonably to balance the traffic load, reduce the collisions and lower the end-to-end delay, which improved the reliability and the scalability of the scheme
Summary
Broadcasting is a communication primitive in wireless ad hoc networks. It is essential to resolve many issues such as route discovery, route maintenance for unicast or multicast and emergency or warning message dissemination in disaster, battlefield, and VANET scenario. The interest in probabilistic broadcasting schemes is due to their inherent low transmission overhead, low processing complexity, low delay, and high tolerance to frequent and rapid topological changes Balancing these benefits, though, is the disadvantage of inability to guarantee full network coverage and, still, the presence of some redundant transmissions. Deterministic schemes use topological information to build a global forwarding structure to reduce broadcast redundancy They can be proven to not degrade reachability compared with flooding and probabilistic schemes, provided communications are perfectly reliable. They do not tolerate frequent topological changes well, because maintaining the forwarding structure in dynamic environment brings excessive control overhead. The velocity-based data distribution mechanism and NKVB scheme are presented in section ‘‘NKVB scheme.’’ Performance evaluation of NKB and NKVB schemes by simulations in the context of wireless ad hoc networks is presented in section ‘‘Performance evaluation.’’ section ‘‘Conclusion’’ concludes the article
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore 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.
