new way of cluster head selection.

1. Madan Mohan Malaviya University of Technology, Gorakhpur
(U.P.) India
Energy efficient Cluster Head Selection in
LEACH protocol
Presented by-
Arun Kumar Yadav
Govinda Gupta
Tinku Kumar Singh
Under Guidance Of
Mrs. Meenu
(Assistant Professor)
Department of Computer Science & Engineering

2. Overview
 Wireless Sensor Network
 Introduction of LEACH
 Phases of LEACH
 Working of LEACH
 Variations of LEACH
 Proposed LEACH
 Conclusion
 References

3. • WSN.
• Base Station.
• Transceiver.
Wireless Sensing Network
Problem
Limited energy of the
sensor.

4. An Introduction
 LEACH stands for Low-Energy Adaptive Clustering Hierarchy.
 This WSN is considered to be a dynamic clustering method.
 Randomized rotation of cluster heads among the sensors .
 All non-cluster head nodes transmit data to their cluster head.
 CH receives this data and performs signal processing functions
on the data and transmits data to the BS.

5. Cluster Head :

6.  The reason we need network protocol such as LEACH is due
to the fact that a node in the network is no longer useful when
its battery dies.
 This protocol allows us to space out the lifespan of the nodes,
allowing it to do only the minimum work it needs to transmit
data.
The Problem

7. Cluster Head
The LEACH Network is made up of nodes, some of which
are called cluster-heads….
 The job of the cluster-head is to collect data from their
surrounding nodes and pass it on to the base station
 LEACH is dynamic because the job of cluster-head rotates

8. LEACH’s two phases
The LEACH network has two phases:
 The set-up phase
 The steady-state
The Set-Up Phase
• Where cluster-heads are chosen
• None cluster head get involved
The Steady-State
• The cluster-head is maintained
• When data is transmitted between nodes

9. Stochastic Threshold Algorithm
 Cluster-heads can be chosen stochastically (randomly based) on this
algorithm:
 If n < T(n), then that node becomes a cluster-head
 The algorithm is designed so that each node becomes a cluster-head at
least once

10. Weakness in LEACH
LEACH assumes that
 It is only suitable for small size networks.
 All nodes have data to send and so assign a time slot for a node even though some
nodes might not have data to transmit.
 Overhead of clustering after certain period of time.
 System stop situation at the time of cluster head failure.
 LEACH requires CHs to transfer their aggregated data to the sink node over a single-
hop link.

11. Variations of LEACH
 LEACH-E
 LEACH-C
 TL-LEACH
 MULTIHOP LEACH
 LEACH-F
 LEACH-ME
 LEACH-B
 LEACH-M
 LEACH-H

12. • Energy Consumption:-
• Energy consumption is the main issue for any data transmission
setup in wireless sensing network.
• System Efficiency:-
• Improvement in cluster head selection can improve system
efficiency.
Our area of work

13. Our area of work(cont…)
• Selection of two CHs on the basis of residual energy.
• One CH perform data gathering, data aggregation and compression.
• Then second CH send the aggregated data to base station.
• The forwarding nodes are selected based on the highest residual
energy among the nodes.

14. Proposed CHs Selection
 Energy dissipated in transmission
 Energy dissipated in receiving
 Energy dissipated by normal cluster nodes

15. sink

16. Conclusion
• On the basis of traditional LEACH protocol, this project proposes an
energy balance algorithm optimizing cluster-head selection.
• considering the residual energy and distance factors, improves cluster-
head election.
• Improves strategy of non-cluster head node selecting the optimal
cluster-head.
• It balance the network energy consumption, heighten system data
transmission, and prolong the nodes and network life.

17. References
• L Xiang, J Luo, A Vasilakos, Compressed data aggregation for energy
efficient wireless sensor networks, in 2011 8th Annual IEEE
Communications
• Yang Jing , Li Zetao , Lin Yi proposed paper on "AN Improved
Routing Algorithm Based on LEACH for WSN" , in 2013 IEEE
Communication.
• ] Hu Junping , Jin Yuhui , Dou Liang proposed paper on "A Time-
based Cluster-Head Selection Algorithm for LEACH " in 2008 IEEE
Communication
• Chenmin Li , Guoping Tan , Jingyu Wu , Lizhong Xu Analyzing
Cluster-Head Selection Mechanism and improving the LEACH at
2011 IEEE Communication .

18. Thanks for your attention…