Cart (Loading....) | Create Account
Close category search window
 

Energy Efficient Clustering Algorithm forWireless 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

2 Author(s)
Soude, H. ; Univ. Paris 8, Saint Denis ; Mehat, J.

In this paper we present an energy efficient centralized clustering algorithm and a quantitative study, in term of messages, of necessary energy to the cluster formation. The cluster formation cost allows to combine efficiently clustering algorithm and cluster-based communication protocols. The cluster formation cost plays an important role in wireless sensor networks life span. Our clustering algorithm use the wireless network features : broadcast and methods such as power transmission control and data gathering to reduce the cluster formation cost. We show that our algorithm allows to reduce by 63% the number of necessary messages to build cluster compared to natural method and by a factor of 10 the cost of cluster formation with respect to the LEACH-C method.

Published in:

Wireless and Mobile Communications, 2006. ICWMC '06. International Conference on

Date of Conference:

29-31 July 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.