By Topic

Clustering routing algorithm for distributed 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)
Pingping Wang ; Dept. of Comput. Sci., HuaZhong Normal Univ., Wuhan, China ; Shangping Dai ; Li Gao

One critical issue in wireless sensor networks is how to gather sensed information in an energy-efficient way since the energy is a scarce resource in a sensor node. In this paper, we propose an improved distributed clustering algorithm, which is called LEACH-W algorithm, In this algorithm, we extend low-energy adaptive clustering cluster-head selection algorithm by a factor with weight value deterministic component to reduce energy consumption. And the probability is proposed so that it balances the energy consumption of nodes for energy efficiency of cluster member. Simulation results show that the proposed algorithm achieves its intention of consuming less energy, as well as extending the network lifetime perfectly, and achieves better performance than the existing representative algorithm.

Published in:

Granular Computing, 2009, GRC '09. IEEE International Conference on

Date of Conference:

17-19 Aug. 2009