New Clustering Schemes for Wireless Sensor Networks

Abstract

In this paper, two clustering algorithms are proposed. In the first one, we<br><br>investigate a clustering protocol for single hop wireless sensor networks that employs a<br><br>competitive scheme for cluster head selection. The proposed algorithm is named EECSM<br><br>that is a modified version to the well known protocol EECS where some of the nodes<br><br>become volunteers to be cluster heads with an equal probability. In the competition<br><br>phase in contrast to EECS using a fixed competition range for any volunteer node, we<br><br>assign a variable competition range to it that is related to its distance to base station. The<br><br>volunteer nodes compete in their competition ranges and every one with more residual<br><br>energy would become cluster head. In the second one, we develop a clustering protocol<br><br>for single hop wireless sensor networks. In the proposed algorithm some of the nodes<br><br>become volunteers to be cluster heads. We develop a time based competitive clustering<br><br>algorithm that the advertising time is based on the volunteer node’s residual energy. We<br><br>assign to every volunteer node a competition range that may be fixed or variable as a<br><br>function of distance to BS. The volunteer nodes compete in their competition ranges and<br><br>every one with more energy would become cluster head. In both proposed algorithms,<br><br>our objective is to balance the energy consumption of the cluster heads all over the<br><br>network. Simulation results show the more balanced energy consumption and longer