N-LEACH, a balanced cost cluster-heads selection algorithm for Wireless Sensor Network

Abstract

Load on individual cluster head node increases (decreases) if there exist less (more) than the optimum number of cluster head nodes, As we only fix the the number of cluster heads and as the nodes choose the nearest cluster head for data transmission, the number of supported nodes may vary for different cluster head nodes. This leads to uneven load distribution among nodes in a Wireless Sensor Network (WSN). We proposed a new cluster head selection method for LEACH clustering routing protocol. It balances the energy consumption of every sensor node in a sensor network. Simulation results show that the lifetime of sensor network is significantly enhanced compared to the LEACH routing algorithm for the wireless sensor networks.