By Topic

A Performance Study of GPSR and GRMax with Grid and Randomly Distributed Nodes 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

2 Author(s)
Attoungble Kouakou Jean Marc ; Nat. Inst. of Inf. & Commun. Technol. (NICT), Tokyo, Japan ; Kazunori Okada

In this paper, we study the performance of the Greedy Perimeter Stateless Routing (GPSR) [1] and the Greedy Routing for Maximum Lifetime (GRMax)[2] which is our proposal, in wireless sensor networks in random topology and grid topology wireless sensor network. We decide to compare the performance of GPSR and GRMax in different topology of networks using the same simulation environment. Evaluation and comparison of GPSR and GRMax is done through OPNET. Results show that GRMax performs better than GPSR with respect to packets delivery fraction, number of dropped packets and network lifetime. With the introduction of VIP nodes, GRMax avoid early network partition in networks with randomly distributed nodes and in networks with grid distribution nodes. Moreover, with the criteria used to choose the next hop node in GRMax, battery power resources are used efficiently. GRMax performs better than GPSR because with its algorithm, from the source to the destination GRMax uses a path close to the straight line.

Published in:

2011 Tenth International Symposium on Autonomous Decentralized Systems

Date of Conference:

23-27 March 2011