An Improved Leach Algorithm Based on Hierarchical Clustering Approach for Wireless Sensor Network Application
Amhmed Bhih, Walid Abushiba, Adel Elashheb
Abstract
Wireless sensor networks composed of a huge number of sensor node with the capability to sense, collect and process data in the physical environment. The sensors are usually battery-powered nodes which limit the network lifespan. Due to energy constraints, the deployment of WSNs required sophisticated techniques to prolong the network operation. A clustering based routing algorithm named Low-Energy Adaptive Clustering Hierarchy (LEACH) is proposed as an energy effective solution. However, in LEACH, the power of nodes in the network is quickly depleted and decreases the life of the network due to the clusters headers that are randomly selected without taking into account the remaining power and the position of the nodes. The enhanced LEACH algorithm, named LEACH-Kmeans, is proposed where the improvement is done in cluster head selection process. LEACH-Kmeans makes use of K-means clustering calculation for choosing optimal cluster heads. A comparison among LEACH, and LEACH-Kmeans clustering has been done. Simulation result shows that LEACH-Kmeans protocol can reduce energy consumption and improve the network lifetime.