The Scalability and Stability Analysis of KLEACH Routing Protocol in Wireless Sensor Networks
Author(s) -
Abdelkader Bourzek,
Abderrahmane Hajraoui,
Saad Chakkor,
Mostafa Baghouri
Publication year - 2016
Publication title -
international journal of computer network and information security
Language(s) - English
Resource type - Journals
eISSN - 2074-9104
pISSN - 2074-9090
DOI - 10.5815/ijcnis.2016.04.03
Subject(s) - computer science , scalability , routing protocol , wireless sensor network , computer network , distributed computing , protocol (science) , cluster analysis , node (physics) , routing (electronic design automation) , software deployment , stability (learning theory) , engineering , database , machine learning , medicine , alternative medicine , structural engineering , pathology , operating system
The scalability and stability in wireless sensor networks (WSNs) are considering as an important issue due to the large numbers of nodes and consequently their node density and deployment. While the network size increase, the need of scalable and efficient routing protocols is indispensable. Moreover, sensor nodes have to be alive to guarantee the network operation for the period which the first node died doesn’t appear. This period, named network stability region, is ameliorated by many techniques. In fact, the balancing energy consumption and clustering method are among those techniques. In this paper, we present the scalability and stability analysis of the routing protocol LEACH based on K-means clustering algorithm (KLEACH). Accordingly, the simulation results of the performance metrics verify the efficiency and the scalability of KLEACH protocol compared to LEACH.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom