Energy Efficient Robust Routing Scheme for Wireless Communication
Saurabh Singh, Sarvpal Singh and Jay Prakash
Greedy Forwarding is considered the most efficient wireless sensor network routing, but it fails over the wireless network with the void region. The proposed two-hop-based greedy routing is an advanced greedy routing. It is much better and more advanced than the traditional Greedy Forwarding approach. It extends the greediness up to neighbors at a two-hop distance, whereas the Greedy Forwarding greediness extends only to neighbors at a single-hop distance. It makes it able to make better decisions while selecting the next node, which generates a shorter route than Greedy Forwarding. It efficiently overcomes the inherent local minimum and intersection problem of the classic Greedy Forwarding. It can efficiently identify the stuck node and the nodes which tend toward the stuck nodes using Greedy Forwarding. After identifying the stuck node and nodes which may lead toward the stuck nodes, it traverses toward the destination avoiding such nodes using two-hop-based greedy routing. We have shown that the proposed routing generates a smaller path than found by the other cost-based void handling techniques. Two-hop-based routing generates shorter routes and efficiently bypasses multiple void regions in the network. The proposed two-hop-based greedy routing is more robust and energy efficient than other cost-based void handling techniques.
Keywords: Greedy forwarding, intersection problem, local minimum problem, void handling techniques