By Topic

An Adaptive and Distributed Clustering Scheme for 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
$33 $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)
Xinguo Wang ; Univ. of Sci. & Technol. of China, Hefei ; Xinming Zhang ; Guoliang Chen ; Shuang Tian

In recent years, wireless sensor networks have gained extensive attentions due to their bright future in military and civil fields. Innovative routing techniques that can prolong the network lifetime are highly demanded. Clustering is an effective technique in applications of periodical data gathering. Most clustering schemes make the common assumption that sensors are uniformly dispersed within an area. In this paper, we propose an adaptive and distributed clustering scheme (ADCS) for wireless sensor networks, which can work very well in both uniform and non-uniform scenes. Our approach elects nodes with comparatively more residual energy and more neighbors as the cluster heads. In the cluster formation phase, the plain nodes choose to join in cluster considering both distance and load balance. ADCS can generate an even distribution of the clusters, which helps to prolong the network lifetime. Simulation results show that ADCS outperforms LEACH significantly by prolonging the network lifetime over 40% in uniform scenes and 75% in non-uniform scenes respectively.

Published in:

Convergence Information Technology, 2007. International Conference on

Date of Conference:

21-23 Nov. 2007