By Topic

Modified GPSR Based Optimal Routing Algorithm for Reliable Communication in WSNs

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
$31 $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

3 Author(s)
Raja, B.S. ; Pervasive Comput. Technol., Anna Univ. of Technol., Tiruchirappalli, India ; Prabakaran, N. ; Dhulipala, V.R.S.

Geographic routing is one of the most widely used routing strategies in large-scale wireless sensor networks (WSN). With location-based routing, small, cheap and resource constrained nodes can perform the routing function without the need of complex computations and large amount of memory space. In the traditional approach, nodes advertise their availability to update the routing table. We eliminate this to reduce energy consumption. We introduce Modified Greedy Perimeter Stateless Routing (GPSR) routing protocol for efficient communication among sensor nodes, which identifies optimal route based on energy utilization. The implementation of GPSR in sensor networks faces many challenges due to limited memory and battery energy on each node, frequent change of network topology and unreliable infrastructure. Our Modified-GPSR approach results in near-optimal communication cost across the network. The simulation results prove that the energy and delay in minimized and substantially increases the network lifetime of sensor node. The proposed protocol outperforms the existing routing protocol for WSNs.

Published in:

Devices and Communications (ICDeCom), 2011 International Conference on

Date of Conference:

24-25 Feb. 2011