An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks
Authors:
- 7 June 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 444-451
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Energy-efficient communication protocol for wireless microsensor networks2005
- Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach2004
- PEGASIS: Power-efficient gathering in sensor information systems2003
- Distributed clustering for ad hoc networks2003
- Upper bounds on the lifetime of sensor networks2002
- Max-min d-cluster formation in wireless ad hoc networks2002
- A mobility-based framework for adaptive clustering in wireless ad hoc networksIEEE Journal on Selected Areas in Communications, 1999
- Adaptive clustering for mobile wireless networksIEEE Journal on Selected Areas in Communications, 1997