Robust and low‐communication geographic routing for wireless ad hoc networks
Matthias Witt, Volker Turau · Wireless Communications and Mobile Computing · 2009
Abstract A novel beacon‐less algorithm called Blind Geographic Routing (BGR) is presented, which comes with an effective and robust recovery strategy to circumvent voids, and a new technique to avoid simultaneous forwarding by more than one node, features not included in other beacon‐less algorithms. BGR is the first beacon‐less algorithm that also works in 3D topologies. Additionally, BGR supports different delivery semantics, which specify how close a node must be to the destination location in order to receive the message, and how many nodes shall receive it. These semantics allow for routing not only to designated nodes with network‐wide known locations such as sinks, but to arbitrary destinations within the network area. It is shown through extensive simulation that BGR performs well even in the case of mobility, radio irregularity, and location errors, while GPSR as a beacon‐based algorithm suffers from severe problems in realistic scenarios that do not follow the unit disk graph model, even with recent enhancements of the original GPSR algorithm. Copyright © 2009 John Wiley & Sons, Ltd.