Enhanced Greedy Anti - Void Routing Protocol with Hop Count Reduction for Wireless Sensor Networks
In this paper the solution to the void problem is taken up as the issue. This situation which exists in the currently existing greedy routing algorithms has been studied for the wireless sensor networks. The GAR protocol is a new protocol proposed here to guarantee the delivery of packets and excessive consumption of control overheads is resolved. This protocol is a combination of the GF algorithm and the RUT scheme. In RUT scheme the usage of Boundary Map concept increases the speed and efficiency in finding the nodes which will aid for a faster and a guaranteed delivery. To enhance this protocol's functionality the authors go in for three mechanisms that can also be implemented in this paper.