A novel Cluster-Head selection algorithm for wireless sensor networks

In recent years, many clustering algorithms have been proposed. LEACH is the most famous one of them. However, 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 opportunity to participate in the process of 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 role it has played in the last round, so more nodes would have the opportunity to become CHs. Simulation results show that the proposed algorithm outperforms LEACH in network lifetime by an average of 30% approximately. In addition, when the scale of network is expanded, the algorithm can also perform better than LEACH.