Greedy Forwarding with Virtual Destination Strategy for Geographic Routing in Wireless Sensor Networks

Abstract

The uneven deployment of wireless sensor networks and the breakdown of sensor nodes often lead to the presence of holes in their topology. Two important factors considered in designing a geographic routing algorithm are overhead and success rate of packet routing. Therefore, in this paper, we present a novel strategy to aid a routing algorithm improve its performance by increasing success rate of packet routing, while there is no significant overhead involved. To evaluate the efficiency of our strategy, we design a novel routing algorithm called Greedy Forwarding with Virtual Destination (GFVD). Moreover, we utilize the concept of virtual position of sensor nodes to design a combined scheme named Greedy Forwarding with Virtual Destination and Virtual Position (GFVD-ViP). Analysis and extensive simulation are conducted to study the efficiency of our schemes compared to the existing ones.