Neighbors Investment Geographic Routing Algorithm in Wireless Sensor Networks

Geographic routing is widely used in wireless sensor networks. The problem that most of the geographic routing algorithms, which adopt greedy algorithm as their basic routing strategies, have to face is the ldquolocal minimal phenomenardquo. In this paper, we propose a neighbors investment geographic routing algorithm (NIGRA), which is based on the geographic information of 2-hop neighbors. NIGRA adopts NIR (neighbors investment routing) algorithm as basic routing strategy, which makes nodes be aware of the existence of voids, so that the packet can bypass the dead-end nodes ahead of time to reduce the occurrence rate of local minimal phenomena. Furthermore, PATN, a planarization algorithm based on 2-hop neighbors, is also introduced. When NIGRA resorts to perimeter routing as recovery strategy, PATN ensures the success of perimeter routing through the planarization without extra overhead, and guarantees the delivery in UDG networks. Extensive simulations further show that NIR algorithm can significantly decrease the local minimal phenomena and NIGRA has better routing performance than GPSR.