loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05)
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks
Towson University, Towson, Maryland, USA
May 23-May 25
ISBN: 0-7695-2294-7
Min Qin, University of Southern California
Roger Zimmermann, University of Southern California
Clustering provides an effective way for extending the lifetime of a sensor network. In this paper, we propose a novel Voting-based Clustering Algorithm (VCA) for energy-efficient data dissemination in quasi-stationary sensor networks. This new approach lets sensors vote for their neighbors to elect suitable cluster heads. Unlike traditional distributed clustering algorithms, VCA combines load balancing, energy and topology information together by using very simple voting mechanisms. This new approach is completely distributed, location-unaware and independent of network size and topology. Simulation results show that our VCA can reduce the number of clusters by 5-25% and prolong the lifetime of a sensor network by 25-30% over that of existing energy-efficient clustering protocols.
Citation:
Min Qin, Roger Zimmermann, "An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks," snpd-sawn, pp.444-451, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.