A Distributed Geo-Routing Algorithm for Wireless Sensor Networks
AbstractGeographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads. View Full-Text
Share & Cite This Article
Joshi, G.P.; Kim, S.W. A Distributed Geo-Routing Algorithm for Wireless Sensor Networks. Sensors 2009, 9, 4083-4103.
Joshi GP, Kim SW. A Distributed Geo-Routing Algorithm for Wireless Sensor Networks. Sensors. 2009; 9(6):4083-4103.Chicago/Turabian Style
Joshi, Gyanendra Prasad; Kim, Sung Won. 2009. "A Distributed Geo-Routing Algorithm for Wireless Sensor Networks." Sensors 9, no. 6: 4083-4103.