By Topic

A Clustering Routing Algorithm Based on Energy and Distance in WSN

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

4 Author(s)
Jia Yunjie ; Dept. of Comput. Sci., Central China Normal Univ., Wuhan, China ; Liu Ming ; Zhu Song ; Dong Pengtao

Clustering routing algorithm is an important and widely used method, which can prolong the lifecycle of WSN. Existing clustering algorithm due to the randomness of selecting the cluster head, it is inevitable that the agreement exists choosing cluster head unreasonable, node energy consumption unbalanced. To address the above issues, this paper presents an improved clustering routing algorithm LEACH-KED on the basis of the uniform clustering, and proceeds simulation analysis. The simulation results show that the improved algorithm is effective in extending the network life cycle.

Published in:

Computer Distributed Control and Intelligent Environmental Monitoring (CDCIEM), 2012 International Conference on

Date of Conference:

5-6 March 2012