An improved routing algorithm based on LEACH for wireless sensor networks

As a typical routing algorithm of hierarchy for wireless sensor networks (WSNs), LEACH is a good solution for energy efficiency. However, LEACH still has some disadvantages, such as unreasonable structure of clustering, direct communication between all cluster heads and sink node, which brings high energy consumption. An improved routing algorithm based on LEACH, known as ILEACH, is proposed in this paper. Firstly, the ILEACH employed the residual energy to form clustering, which can avoid the low energy node becoming a clusterhead. Secondly, an energy function is proposed to balance the energy consumption among clusterheads. Finally, a data aggregation tree is constructed to transmit the data from the clusterheads to sink node. Simulation results show that the proposed algorithm provides higher performance and longer network lifetime, compared with LEACH.