IMPROVING ON THE NETWORK LIFETIME OF CLUSTERED-BASE D WIRELESS SENSOR NETWORK USING MODIFIED LEACH ALGORI THM

Wireless sensor networks (WSNs) composed from a lar ge number of sensor node with the ability to sense and process data in the p hysical world in a timely manner. The sensor nodes contain a battery constraint which limit the network lifetime. Due to energy constraints, the deployment of WSNs will required advance techniques to maintain the network lifetime. A clustering based r outing algorithm called LowEnergy Adaptive Clustering Hierarchy (LEACH) was pr o osed as a solution for low power consumption. This document is a study about L EACH algorithm where the implementation was done using OMNeT++ network simul ator to study the performance of this algorithm in term of network li fet me. OMNeT++ was selected as a simulator because it provides some important f eatures for this project like very good scalability unlike other simulators do. During this study, LEACH algorithm shows some drawbacks that need an improvements to o vercome it as to improve the performance. Then, the modified LEACH algorithm was proposed where the improvement was done in cluster head selection base d on LEACH. In cluster head selection, modified LEACH taking into account the r esidual energy of each node for calculation of the threshold value for next round. Meanwhile in LEACH, the cluster head selection was based on distributed algorithm. Both of these protocols was implemented in network simulator to compare the per formance. This study shows that there were a better performance achieved by mo dified LEACH depends on the results obtained.