By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ngoc Duy Nguyen ; Sch. of Inf. & Commun. Eng., Sungkyunkwan Univ., Suwon, South Korea ; Dang Tu Nguyen ; Marc-Aurelien Le Gall ; Navrati Saxena
more authors

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.

Published in:

Computational Science and Its Applications (ICCSA), 2010 International Conference on

Date of Conference:

23-26 March 2010