An Energy-Balanced Clustering Routing Algorithm for Wireless Sensor Network

Abstract

In this paper, we consider a network of energy constrained sensors deployed over a region. Each sensor node in such a network is systematically gathering and transmitting sensed data to a base station (via cluster- heads). This paper focuses on reducing the power consumption of wireless sensor networks. Firstly, we proposed an Energy-balanced Clustering Routing Algorithm called LEACH-L, which is suitable for a large scope wireless sensor network. Secondly, optimum hop-counts are deduced. Lastly, optimum position of transmitting node is estimated. Simulation results show that our modified scheme can extend the network lifetime by up to 80% before first node dies in the network. Through both theoretical analysis and numerical simulations, it is shown that the proposed algorithm achieves higher performance than the existing clustering algorithms such as LEACH, LEACH-M.