A geographic routing hybrid approach for void resolution in wireless sensor networks

Abstract: Geographic routing is one of the most suitable routing strategies for large scale wireless sensor networks due to its low overhead and high scalability features. A geographic routing scheme usually combines a geographic greedy forwarding with a recovery mechanism to solve the local minima problem. Solutions proposed in the literature commonly combine greedy forwarding with the well known face routing for achieving this goal. However, the average path length in number of hops produced by face routing could be much worse than the optimal topological path in most realistic scenarios. In this paper, we propose a new intermediate procedure between the geographic greedy mode and the recovery mode in order to improve routing efficiency in number of hops, without network overhead. It exploits the optimal topological route to base stations, obtained by beacon messages, as a resource to find better routes than the ones created by face routing. We show by simulations that the proposed hybrid approach leads to a significant improvement of routing performance when applied to combined greedy-face routing algorithms.