Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks

Abstract: Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed weight-based energy-efficient hierarchical clustering protocol (DWEHC). Each node first locates its neighbors (in its enclosure region), then calculates its weight which is based on its residual energy and distance to its neighbors. The largest weight node in a neighborhood may become a clusterhead. Neighboring nodes will then join the clusterhead hierarchy. The clustering process terminates in O(1) iterations, and does not depend on network topology or size. Simulations show that DWEHC clusters have good performance characteristics.

• Type: Conference
• Year: 2005
• Where: DCOSS
• Authors: Ping Ding, JoAnne Holliday, Aslihan Celik
• Keywords: Clustering Process Terminates, DCOSS 2005, Energy-efficient Hierarchical Clustering, Largest Weight Node