Modified LEACH: A QoS-aware Clustering Algorithm for Wireless Sensor Networks

Energy efficient Routing algorithms for wireless sensor network play a vital role among many other algorithms for improving lifetime of sensor network. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the major hierarchical routing protocols for WSNs, in which cluster heads are randomly elected. In this paper, a Modified LEACH algorithm is proposed to maximize the lifetime of the network. The network is partitioned into clusters using simulated annealing technique. The cluster head and next heads are chosen by the base station based on their residual energy. Unlike LEACH, re-clustering is not done after completion of each round. Re-clustering is done once the energy of the elected heads goes below the threshold. This in turn reduces the node and network failure, thus making the network fault-tolerant. The QoS parameters such as throughput, packet delivery ratio, delay and network lifetime are metrics used to measure the performance of Modified LEACH. Simulation results show that Modified LEACH outperforms the LEACH protocol and the AODV protocol.