Clustering in WSN Using Node Ranking with Hybrid Nodes Duty-Cycle and Energy Threshold

The denseness and random distribution of large-scale WSNs makes it quite difficult to replace or recharge nodes. Energy efficiency and management is a major design goal in these networks. In this paper, a new node energy efficient algorithm using energy thresholds to replace cluster heads is proposed. The proposed algorithm uses node ranking to elect cluster heads based on energy levels and positions of the nodes in reference to the base station (BS) which is used as a sink for gathered information. Since the BS calculates the number of rounds a cluster head can remain through in advance, this feature will have a great effect in prolonging the network life time as it reduces the amount of energy wasted on replacing cluster heads. In addition, hybrid redundant nodes duty-cycle is used for nodes to take turn in covering the monitored area which will improve the performance further. The performance of this algorithm compared to other well-known algorithms is shown. Also the performance of the algorithm using random cluster heads replacement and using threshold values to replace the cluster heads are compared.