A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks
Atekeh Maghsoudlou, Marc St‐Hilaire, Thomas Kunz · 2011
Geographic routing has become one of the most suitable routing strategies in wireless mobile ad hoc network mainly due to its scalability. That is because there is no need to maintain explicit routes. The principle approach in geographic routing is greedy forwarding, which fails if the packet encounters a void node (i.e., a node with no neighbour closer to the destination than itself). Face routing and its variations have been proposed and widely studied in the literature as recovery strategies to handle voids. However, face routing strategies are based on two primitives, planarization and face traversal, which make them unsuitable in 3D networks. This survey presents an overview of different face routing algorithms as well as alternatives to face routing strategies. The majority of the proposed face routing strategies and void handling techniques are designed with some idealized assumptions, which are not usually true in realistic scenarios and special types of networks such as sparse networks. We will discuss some of the shortcomings and possible directions for future research from an unmanned aeronautical ad hoc networks’