Performance Comparison of LEACH and LEACH-N Protocols BY MATLAB

Main Article Content

Poonam Sharma


In recent years, there has been a growing interest in wireless sensor networks. In Wireless Sensor Networks sensor nodes life time is the most critical parameter. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for sensor networks. LEACH includes the distributed cluster formation, local processing to reduce global communication, and randomized rotation of the cluster-heads. A wireless sensor network consists of hundreds or thousands of small energy-limited sensors that are densely deployed in the large geographical region. It has been demonstrated that Low-Energy Adaptive Clustering Hierarchy (LEACH) is an energy-efficient routing algorithm for Wireless Sensor Networks (WSN). In this paper, we present a cluster head selection approach for LEACH. We state the principles of the LEACH and give the main flowchart and algorithms realizing LEACH. We improves the choice method of the cluster head, makes some nodes which have more residual energy as cluster heads in next round. We seek an energy-optimal enhancement to the network in such way that maximizes network lifetime while ensuring simultaneously full area coverage and sensor connectivity to cluster heads. We compare the live time of LEACH and LEACH-N Protocol.


Keywords: Routing protocol; energy efficient; LEACH; wireless sensor network


Download data is not yet available.

Article Details