By Topic

Performance Comparison of Optimization Algorithms for Clustering 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
$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)
Abdul Latiff, N.M. ; Newcastle Univ., Newcastle upon Tyne ; Tsimenidis, C.C. ; Sharif, B.S.

Clustering in wireless sensor networks (WSNs) is one of the techniques that can expand the lifetime of the whole network through data aggregation at the cluster head. This paper presents performance comparison between particle swarm optimization (PSO) and genetic algorithms (GA) with a new cost function that has the objective of simultaneously minimizing the intra-cluster distance and optimizing the energy consumption of the network. Furthermore, a comparison is made with the well known cluster-based protocols developed for WSNs, LEACH (low-energy adaptive clustering hierarchy) and LEACH-C, the later being an improved version of LEACH, as well as the traditional K-means clustering algorithm. Simulation results demonstrate that the proposed protocol using PSO algorithm has higher efficiency and can achieve better network lifetime and data delivery at the base station over its comparatives.

Published in:

Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on

Date of Conference:

8-11 Oct. 2007