An energy efficient scheme for data gathering in wireless sensor networks using particle swarm optimization

Energy efficiency of sensor nodes is a sizzling issue,given the severe resource constraints of sensor nodes andpervasive nature of sensor networks. The base station beinglocated at variable distances from the nodes in the sensor field,each node actually dissipates a different amount of energy totran...

Full description

Bibliographic Details
Main Authors: Ayon Chakraborty, Kaushik Chakraborty, Swarup Kumar Mitra, Mrinal K. Naskar
Format: Article
Language:English
Published: Stefan cel Mare University of Suceava 2009-01-01
Series:Journal of Applied Computer Science & Mathematics
Subjects:
Online Access:http://www.jacs.usv.ro/getpdf.php?issue=6&paperid=61
Description
Summary:Energy efficiency of sensor nodes is a sizzling issue,given the severe resource constraints of sensor nodes andpervasive nature of sensor networks. The base station beinglocated at variable distances from the nodes in the sensor field,each node actually dissipates a different amount of energy totransmit data to the same. The LEACH [4] and PEGASIS [5]protocols provide elegant solutions to this problem, but may notalways result in optimal performance. In this paper we haveproposed a novel data gathering protocol for enhancing thenetwork lifetime by optimizing energy dissipation in the nodes.To achieve our design objective we have applied particle swarmoptimization (PSO) with Simulated Annealing (SA) to form asub-optimal data gathering chain and devised a method forselecting an efficient leader for communicating to the basestation. In our scheme each node only communicates with aclose neighbor and takes turns in being the leader depending onits residual energy and location. This helps to rule out theunequal energy dissipation by the individual nodes of thenetwork and results in superior performance as compared toLEACH and PEGASIS. Extensive computer simulations havebeen carried out which shows that significant improvement isover these schemes.
ISSN:2066-4273
2066-3129