The Scalability and Stability Analysis of KLEACH Routing Protocol in Wireless Sensor Networks

Full Text (PDF, 646KB), PP.22-29

Views: 0 Downloads: 0


Abdelkader Bourzek 1,* Abderrahmane Hajraoui 1 Saad Chakkor 1 Mostafa Baghouri 1

1. University of Abdelmalek Essaâdi, Faculty of Sciences, Department of Physics, Communication and Detection Systems Laboratory, Tetouan, Morocco

* Corresponding author.


Received: 11 Sep. 2015 / Revised: 3 Dec. 2015 / Accepted: 11 Jan. 2016 / Published: 8 Apr. 2016

Index Terms

Scalability, stability, K-means, clustering, node density, routing protocol, balancing of energy consumption


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.

Cite This Paper

Abdelkader Bourzek, Abderrahmane Hajraoui, Saad Chakkor, Mostafa Baghouri, "The Scalability and Stability Analysis of KLEACH Routing Protocol in Wireless Sensor Networks", International Journal of Computer Network and Information Security(IJCNIS), Vol.8, No.4, pp.22-29, 2016. DOI:10.5815/ijcnis.2016.04.03


[1]I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer networks, Vol. 38, No. 4, pp. 393–422, 2002.
[2]A. Ha?, “Wireless sensor network designs,” Chichester, West Sussex, England?; Hoboken, NJ: J. Wiley, 2003.
[3]M. S. V. Dhage, A. N. Thakre, and S. W. Mohod, “A Review on Scalability Issue in Wireless Sensor Networks,” International Journal of Innovative Research in Advanced Engineering (IJIRAE), Vol. 1, pp. 463–466, November 2014.
[4]S. P. Singh and S. C. Sharma, “A Survey on Cluster Based Routing Protocols in Wireless Sensor Networks,”Procedia Computer Science, Vol. 45, pp. 687–695, 2015.
[5]D. Bhattacharyya, T. Kim, and S. Pal, “A Comparative Study of Wireless Sensor Networks and Their Routing Protocols,” Sensors, Vol. 10, No. 12, pp. 10506–10523, Nov. 2010.
[6]K. Akkaya and M. Younis, “A survey on routing protocols for wireless sensor networks,” Ad Hoc Networks, Vol. 3, No. 3, pp. 325–349, May 2005.
[7]F. Kiani, E. Amiri, M. Zamani, T. Khodadadi, and A. Abdul Manaf, “Efficient Intelligent Energy Routing Protocol in Wireless Sensor Networks,” International Journal of Distributed Sensor Networks, Vol. 2015, pp. 1–13, 2015.
[8]J.-S. Leu, T.-H. Chiang, M.-C. Yu, and K.-W. Su, “Energy Efficient Clustering Scheme for Prolonging the Lifetime of Wireless Sensor Network With Isolated Nodes,” IEEE Communications Letters, Vol. 19, No. 2, pp. 259–262, Feb. 2015.
[9]N. A. Pantazis, S. A. Nikolidakis, and D. D. Vergados, “Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey,” IEEE Communications Surveys & Tutorials, Vol. 15, No. 2, pp. 551–591, 2013.
[10]C. Li, H. Zhang, B. Hao, and J. Li, “A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks,” Sensors, Vol. 11, No. 12, pp. 3498–3526, Mar. 2011.
[11]W. B. Heinzelman, “Application-specific protocol architectures for wireless networks,” Massachusetts Institute of Technology, 2000.
[12]W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in System sciences, Proceedings of the 33rd annual Hawaii international conference, 2000.
[13]R. Patel, S. Pariyani, and V. Ukani, “Energy and throughput analysis of hierarchical routing protocol (LEACH) for wireless sensor network,” International Journal of Computer Applications, Vol. 20, No. 4, 2011.
[14]B. Mostafa, C. Saad, and H. Abderrahmane, “Fuzzy logic approach to improving Stable Election Protocol for clustered heterogeneous wireless sensor networks,” Journal of Theoretical and Applied Information Technology, Vol. 53, No. 3, 2013.
[15]M. Hadjila and M. Fehman, “A comparative study of the wireless sensor networks routing protocols scalability,” International Journal of Distributed and Parallel Systems (IJDPS), Vol. 2, No. 4, pp. 26–33, 2011.
[16]L. K. Alazzawi, A. M. Elkateeb, A. Ramesh, and W. Aljuhar, “Scalability Analysis for Wireless Sensor Networks Routing Protocols” 22nd International Conference on Advanced Information Networking and Applications, 2008 IEEE, pp. 139–144, 2008.
[17]S. Raghuwanshi and A. Mishra, “A self-adaptive clustering based algorithm for increased Energy-efficiency and Scalability in Wireless Sensor Networks,” in Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, Vol. 5, pp. 2921–2925, 2003.
[18]W. M. McEneaney and W. H. Fleming, Eds., “Stochastic analysis, control, optimization and applications,” a volume in honor of W. H. Fleming. Boston: Birkh?user, 1999.
[19]I. Dietrich and F. Dressler, “On the lifetime of wireless sensor networks,” ACM Transactions on Sensor Networks, Vol. 5, No. 1, pp. 1–39, Feb. 2009.
[20]Y. Gong, G. Chen, and L. Tan, “A balanced serial k-means based clustering protocol for wireless sensor networks,” in Wireless Communications, Networking and Mobile Computing, 2008. WiCOM’08. 4th International Conference, pp. 1–6, 2008.
[21]S. Sirsikar and K. Wankhede, “Comparison of Clustering Algorithms to Design New Clustering Approach,” Procedia Computer Science, Vol. 49, pp. 147–154, 2015.
[22]W. Peng and D. J. Edwards, “K-means like minimum mean distance algorithm for wireless sensor networks,” in Computer Engineering and Technology (ICCET), 2010 2nd International Conference, Vol. 1, pp. V1–120, 2010.