z-logo
open-access-imgOpen Access
Enhancement of the QoS Parameter of LEACH Protocol using Modified K -Means Algorithm
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1164.0782s619
Subject(s) - computer science , cluster analysis , quality of service , wireless sensor network , energy consumption , network packet , throughput , computer network , routing protocol , protocol (science) , algorithm , real time computing , wireless , distributed computing , engineering , artificial intelligence , medicine , telecommunications , alternative medicine , pathology , electrical engineering
Wireless Sensor Network (WSN) is a collection of battery operated sensors deployed in the monitoring area. A massive quantity of energy of the nodes is used in the internal and external communications. There is a need of energy saving mechanism for effective and efficient communication. In this paper, we propose a new Modified-LEACH (MD-LEACH) protocol for enhancing the Quality of Services (QoS) parameters. This hierarchical routing protocol (MD-LEACH) is inspired by the k-means clustering technique to consolidate sensor networks into clusters and acquire an enhanced QoS parameter. The kmeans algorithm efforts to improve the clustering procedure of LEACH protocol using Euclidean distance and prolong the lifespan of the sensor network. This algorithm forms the optimized clusters by a distance of cluster head from cluster nodes and energy of the nodes for designated the cluster heads. To evaluate the performance of the proposed approach, we used NS-2 simulator, and consider the QoS parameter, namely: packet delivery ratio, energy consumption, bandwidth, and throughput. The simulations results show that the MD-LEACH algorithm outperforms then the LEACH protocol by optimizing all QoS parameters and improved network performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here