GRID: A geographic routing with identified void in ad hoc and sensor networks

The geographic routing in ad hoc and sensor networks takes advantage of stateless nature to achieve outstanding scalability. However, it is also the statelessness constrain current geographic routing algorithms at best delivery guaranteed solutions, while the path optimality is of little concerned. In this paper, we present a novel geographic routing algorithm, called GRID, as attempt to find optimal path from source to destination even if some parts of the network are unavailable for forwarding due to low density or obstacles. To break the limitation of statelessness, GRID identifies the boundary of communication void and spread information about it in vicinity. With the knowledge of void, intermediate node divert the path in advance to achieve less hop count and shorter travel distance. By means of simulations under various scenarios, we compare its performance with existing state of the art protocols, showing that it performs better in terms of delivery delay and delivery ratio. 1548-7741/