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

Energy-Efficient Distributed Clustering Algorithm Based on Coverage

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)
Xu Yi ; Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China ; Xu Yong-qiang

In the field of wireless sensor network, it is one of the hottest issues of current research that how to maintain the quality of network coverage and balance nodes' energy consumption to optimize the network lifetime. This paper analyzed LEACH (low energy adaptive clustering hierarchy) and proposed an energy-efficient distributed clustering algorithm on coverage (ECAC). In the algorithm, the redundancy degree of coverage and node's rest energy are considered. Moreover, the distribution of cluster head is more reasonable. Simulation results show that: the improved algorithm can efficiently reduce the network energy consumption and improve the quality of coverage.

Published in:

Distributed Computing and Applications to Business Engineering and Science (DCABES), 2010 Ninth International Symposium on

Date of Conference:

10-12 Aug. 2010

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.