An energy-efficient adaptive clustering routing algorithm for wireless sensor networks

An energy-efficient adaptive clustering routing algorithm (EEACRA) for wireless sensor networks was proposed, in order to overcome the drawbacks with the cluster heads in LEACH, such as over-accumulated energy consumption, irrational distribution, none-optimal proportion, etc. EEACRA made several improvements. First, the node with more energy had more chances to become a cluster head by introducing the energy-weighted factor and energy decision condition in cluster head electing threshold. Second, the energy-weighted delay strategy involved in cluster head broadcasting phase optimized the cluster heads distribution and decreased the collision probability. Third, the introduced mechanism of minimum energy cost multi-hop routing reduced the energy consumption of cluster heads. The simulation results show that the EEACRA can not only effectively balance the whole network energy consumption, but also prolong the network lifecycle.