Performance of Greedy Algorithm for Detecting the Void Problem and Routing in Wireless Sensor Networks

Routing protocols plays a very significant part to produce interruption less and efficient communication between source and destination nodes. The performance, service and reliability of a network mostly depend on the selection of good routing protocol. The void problem causing the routing failure is the main challenge of the greedy routing in the wireless sensor networks. The topology of a remote sensor system changes as a few sensors come up short on force, fall flat or Join the system; which might bring about loss of information or the velocity of exchange of information backs off. This issue is solved using Greedy Algorithm and the Hop Count Reduction (HCR) plan is used as a short-listening so as to slice procedure to decrease the steering bounces to the neighbor's movement. The GAR protocol is a new protocol proposed here to guarantee the delivery of packets and excessive consumption of control overheads is resolved. The unreachability problem (i.e., void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks.