The novel threshold based hierarchical clustering method for Wireless Sensor Networks

In designing of the routing protocols for Wireless Sensor Networks, clustering is one of the methods used to manage network energy consumption efficiently. LEACH is one of the most famous clustering mechanisms. It elects a cluster head based on probability model. In LEACH, within each 1/p rounds, once a node has been selected as a cluster-head (CH), its threshold will be set to 0, and thus it will lose the chance to participate cluster-head selection, even if it still has enough energy. In this paper, we present a novel cluster-head selection algorithm. Instead of changing the threshold to 0 directly, the proposed algorithm adjusts the threshold of each node gradually according to the number of live and dead nodes in each round, so more nodes could have the opportunity to be CHs. Simulation results demonstrate that the proposed algorithm has higher efficiency and can achieve better network lifetime and energy consumption.