Void Handling in 3D Wireless Sensor Networks

In geographical routing, route establishment is based on known locations of the nodes in wireless networks. There are many geographical routing protocols based on greedy and face routing approach have been proposed in the literature. However, greedy approach suffers from the void node problem and face routing requires planarity of the network, which is not possible in case of three dimensional networks, hence, greedy approach with void node handling is an option for the routing in 3D networks. The void region is an area of the network where communication is not possible. In this paper, we have proposed an angular void handling routing (AVHR) algorithm to handle the void node problem in wireless sensor networks. The proposed algorithm outperforms the existing algorithms in the context of network lifetime, packet delivery ratio and traffic overhead.