An Optimal Algorithm for Minimizing Cluster Overlap of ACE

  • Authors:
  • Qiang Hu;Qiaoliang Li;Xiaoming Wang;Naixue Xiong;Yi Pan

  • Affiliations:
  • School of Computer Science and Communication, Hunan University, Changsha, China 410082;School of Computer Science and Communication, Hunan University, Changsha, China 410082 and Department of Computer Science, Georgia State University, Atlanta, USA 30319;School of Computer Science, Shanxi Normal University, Xi'an, China 710062 and Department of Computer Science, Georgia State University, Atlanta, USA 30319;Department of Computer Science, Georgia State University, Atlanta, USA 30319;Department of Computer Science, Georgia State University, Atlanta, USA 30319

  • Venue:
  • WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to reduce channel contention, support scalability and prolong the lifetime of the sensor networks, sensor nodes are often grouped into clusters. Algorithm for Cluster Establishment (ACE) is a clustering algorithm for sensor networks that uses three rounds of feedback to induce the formation of a highly efficient cover of uniform clusters over the network. In this paper, we present an optimizing algorithm for minimizing the cluster overlap of ACE. Simulation shows the proposed algorithm can efficiently eliminate the redundant cluster heads and minimize the cluster overlap.