An improved modified LEACH-C algorithm for energy efficient routing in Wireless Sensor Networks

Amit Mansukh lal Parmar, Ankit Thakkar


Wireless Sensor Networks (WSN) is mainly characterized by its limited power supply. Hence the need for

Energy efficient infrastructure is becoming increasingly more important since it impact in network lifetime. Here the focus of this paper on Hierarchy clustering because multi-hope short range communication between wireless sensor nodes is energy efficient compared to Single-hope long range communication. In Hierarchy clustering, there are many Protocols but this paper talk about the well-known Low-Energy Adaptive Clustering Hierarchy (LEACH)[1].Centralized Low-Energy Adaptive Clustering Hierarchy (LEACH-C) and Advanced Low-Energy Adaptive Clustering Hierarchy(ALEACH) are energy efficient clustering routing protocol and they are belonging to hierarchy routing. In this paper we proposed Modified LEACH-C to upgrade the execution of existing Leach-C in such sort of Topology where Leach-C not performs so well. By Applying Method of Distance calculation between CH (cluster-head) to Member node and BS (base-station) to Member node. Making non-overlapping cluster using assigning proper ID while creating clusters. This makes the routing protocol more energy effective and delays life-time of a wireless sensor network. Simulation results demonstrate that Modified LEACH-C enhances network life-time contrasted with LEACH-C algorithm.

Full Text:



  • There are currently no refbacks.

Copyright (c) 2016 Amit Mansukh lal Parmar, Ankit Thakkar

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.