Abstract
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). To reduce the control overhead due to these messages, beacon-less routing algorithms have recently been proposed. However, existing beacon-less algorithms have not considered realistic physical layers. Therefore, those algorithms cannot work properly in realistic scenarios. In this paper we present a new beacon-less routing protocol EBGR. Its design is based on the new delay function to reduce collisions and duplicate messages produced during the phase of selecting the next forwarder. Through extensive simulations on NS2 we compare proposed beaconless routing protocol with BLR and CBF and show that our scheme is able to achieve almost perfect packet delivery ratio (like BLR) while having a low bandwidth consumption.
Sign-in/Register to access full text options 
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
