An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks

  • Authors:
  • Min Qin;Roger Zimmermann

  • Affiliations:
  • University of Southern California;University of Southern California

  • Venue:
  • SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.