An energy efficient hierarchical clustering algorithm for wireless sensor networks

• Published in: IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) Vol. 3; pp. 1713 - 1723 vol.3
• Main Authors: Seema Bandyopadhyay, Coyle, E.J.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2003
• Subjects: Clustering algorithms; Energy efficiency; Energy resources; Event detection; Message passing; Process design; Sensor phenomena and characterization; Stochastic processes; Transceivers; Wireless sensor networks
• ISBN: 9780780377523; 0780377524
• ISSN: 0743-166X; 2641-9874
• DOI: 10.1109/INFCOM.2003.1209194

A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.