Close category search window
 

The Clustering Algorithm of Wireless Sensor Networks Based on Multi-hop between Clusters

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

5 Author(s)
Guitang Wang ; Fac. of Inf. Eng., Guangdong Univ. of Technol., Guangzhou, China ; Honglei Zhu ; Hui Dai ; Liming Wu
more authors

By the reason of the node energy in wireless sensor networks is limited, energy-efficient routing algorithm must be designed to prolong the network lifetime. The paper proposes one new algorithm (MH-LEACH) based on classical Low Energy Adaptive Clustering Hierarchy (LEACH). It selects cluster head with taking into account the energy and multi-hop combined with simple hop in cluster. Simulation results show that compared to LEACH, MH-LEACH has better effect on prolonging the network lifetime and improving the energy utilization rate.

Published in:
Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:3 )

Date of Conference: March 31 2009-April 2 2009

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.