Upcoming SlideShare
×

# Leach protocol

4,516 views
4,261 views

Published on

3 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

Views
Total views
4,516
On SlideShare
0
From Embeds
0
Number of Embeds
7
Actions
Shares
0
665
0
Likes
3
Embeds 0
No embeds

No notes for slide

### Leach protocol

1. 1. LEACH protocol for WIRELESS SENSOR NETWORK CALCUTTA INSTITUTE OF ENGINEERING AND MANAGEMENT 24/1A, CHANDI GHOSH ROAD, KOLKATA-700040 2012-2013 Presented by: RAMESH VERMA ANIL KUMAR PRAVIND KUMAR C.S.E.4th Year
2. 2. Overview-LowEnergyAdaptiveClusteringHierarchy (LEACH)  Introduction to leach protocol  Two phases of leach  Set-up phase/ thresold algorithm  Set-up phase/advertisement  Set-up to steady state phase  Weakness in leach  DECSA(Distance Energy Cluster Structure Algorithm )  Initialization stage  Stable working stage  comparision
3. 3. IntroductiontoLEACHprotocol  Falls under hierarchical networks  Self-organizing, adaptive clustering protocol that uses randomization to distribute energy load evenly  Dense network of sensor nodes grouped into clusters.  All nodes are assumed to be homogenous + energy constrained.  Base station is fixed + away from sensors.  Cluster member elect cluster head to avoid excessive energy consumption.  Incorporates data aggregation.
4. 4. LEACH two phases  It has two phases  The set-up phase and the steady- state phase  The set-up phase where cluster heads are chosen  The steady state phase the cluster head is maintained where data is transmitted between nodes
5. 5. Set-up phase/ Thresold algorithm  Cluster-heads can be chosen stochastically (randomly based) on this algorithm: T(n) =P/1-P*(r mod/p) if n€G 0 , otherwise Where n is a random no. between 0 and 1 and P is cluster head probability and G is the set of nodes that were not cluster head in the last round.  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