A fairly balanced clustering algorithm for routing in wireless sensor networks
Ouadoudi Zytoune, Youssef Fakhri, Driss Aboutajdine · Sensor Review · 2010
Purpose Routing protocols in wireless sensor networks (WSN) are a crucial challenge for which the goal is maximizing the system lifetime. Since the sensor nodes are with limited capabilities, these routing protocols should be simple, scalable, energy‐efficient, and robust to deal with a very large number of nodes, and also self‐configurable to node failures and changes of the network topology dynamically. The purpose of this paper is to present a new algorithm for cluster forming in WSN based on the node energy required to transmit to the base station. Design/methodology/approach Rotation selection of cluster‐head considering the remoteness of the nodes to the sink, and the network node residual energy. Findings The simulation results show that this algorithm allows network stability extension compared to the most known clustering algorithm. Originality/value Giving a probability to become cluster‐head based on the remoteness of the node to the sink.