An improved clustering algorithm based on intersecting circle structure

Download PDF
Open Webpage

Ze-Jun Yang, Yinglong Wang, Fu-Meng Zhao, Tai-Bo Huang

Published: 2012, Last Modified: 08 Jan 2026CSCWD 2012EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: A good clustering algorithm can provide the basis for forming a good network topology and target location, improve routing efficiency and greatly reduce energy consumption. For the lack of GAF algorithm, an improved algorithm is putted forward. First of all, the monitored area is divided into many sections according to the intersecting circle structure. Then the nodes which meet specific criteria will be elected as cluster heads. Finally, some nodes in overlapping area of intersecting circles will be elected as the Mid Nodes to achieve multi-hops routing. As is shown in the experiment, the improved algorithm can greatly save energy consumption of nodes, and extend the lifetime of wireless sensor networks.