Documente Academic
Documente Profesional
Documente Cultură
LEACH
Low Energy Adaptive Clustering Hierarchy
Outline
1. Preface. 2. Problem Definition. 3. LEACH Assumptions. 4. LEACH Protocol Architecture. 1. Determining Cluster Head nodes. 2. Set-up phase. 3. Steady State phase. 4. LEACH Protocol Variations (LEACH-C, LEACH-F). 5. Simulations of LEACH. 6. Conclusion. 7. References.
TU Dresden, 23/01/2007
LEACH
TU Dresden, 23/01/2007
LEACH
TU Dresden, 23/01/2007
LEACH
TU Dresden, 23/01/2007
LEACH
TU Dresden, 23/01/2007
LEACH
Assumption
Radio characteristics 1. Same energy dissipation in transmit and receive circuitry 2. r2 Energy loss due to channel transmission 3. Radio channel is symmetric Sensor Characteristics 1. Sensors are sensing environments at fixed rate 2. Sensors communicate among each other and to the base station 3. All sensors are homogenous and have energy-constraint Base Station 1. Base station is fixed 2. Base station is located far from sensors
TU Dresden, 23/01/2007 LEACH 7
TU Dresden, 23/01/2007
LEACH
LEACH Architecture
TU Dresden, 23/01/2007
LEACH
TU Dresden, 23/01/2007
LEACH
10
Setup phase
At the beginning of each round, each node advertises it probability, (depending upon its current energy level) to be the Cluster Head, to all other nodes. Nodes (k for each round) with higher probabilities are chosen as the Cluster Heads. Cluster Heads broadcasts an advertisement message (ADV) using CSMA MAC protocol. Based on the received signal strength, each non-Cluster Head node determines its Cluster Head for this round (random selection with obstacle). Each non-Cluster Head transmits a join-request message (Join-REQ) back to its chosen Cluster Head using a CSMA MAC protocol. Cluster Head node sets up a TDMA schedule for data transmission coordination within the cluster.
TU Dresden, 23/01/2007
LEACH
11
TU Dresden, 23/01/2007
LEACH
12
(1)
TU Dresden, 23/01/2007
LEACH
13
(2)
Ci(t) = it determines whether node i has been a Cluster Head in most recent (r mod(N/k)) rounds.
TU Dresden, 23/01/2007
LEACH
14
= total no. of nodes eligible to be a cluster-head at time t. This ensures energy at each node to be approx. equal after every N/k rounds. Using (2) and (3), expected no of Cluster Heads per round is,
(4)
TU Dresden, 23/01/2007
LEACH
15
TU Dresden, 23/01/2007
LEACH
16
Clusters at time t
TU Dresden, 23/01/2007 LEACH
Steady-State Phase
TU Dresden, 23/01/2007
LEACH
18
Steady-State Phase
TU Dresden, 23/01/2007
LEACH
19
TU Dresden, 23/01/2007
LEACH
20
L:1 data compression. EDA : energy dissipation per bit for data aggregation. ETX : energy dissipation per bit to transmit to BS.
TU Dresden, 23/01/2007
LEACH
21
L = 20, BS is 100m away, cost of commn. to BS = 1.05 X 10-6 J /bit . Result: when energy to perform DA < 1.05 X 10-6 J, total energy dissipation of the system is less using data aggregation.
TU Dresden, 23/01/2007 LEACH 22
TU Dresden, 23/01/2007
LEACH
23
TU Dresden, 23/01/2007
LEACH
24
TU Dresden, 23/01/2007
LEACH
25
LEACH Simulation
tround = 0.08 seconds * (Estart / 9 mJ) Estart : initial energy of the nodes. tround : time after which cluster-heads and associated clusters should be rotated
TU Dresden, 23/01/2007
LEACH
26
Energy dissipation
System Lifetime
TU Dresden, 23/01/2007
LEACH
27
TU Dresden, 23/01/2007
LEACH
28
LEACH Results
1. Factor of 7 reduction in energy dissipation as compared to Direct Communication 2. Uniform distribution of energy-usage in the network 3. Doubles the system lifetime compared to other methods 4. Nodes die essentially in random fashion, thus maintain the network coverage
TU Dresden, 23/01/2007
LEACH
29
TU Dresden, 23/01/2007
LEACH
30
LEACH Pros
Pros 1. As Hierarchical Topology, LEACH is fundamental algorithm design. 2. Theoretical analysis go well with the simulation results. 3. Better energy utilization and system life time. 4. The algorithm provides prolonged network coverage ( low latency ).
TU Dresden, 23/01/2007
LEACH
32
LEACH Cons
Cons 1. The simulations are still to be performed using the Network simulator 2. Fault-tolerance issues when nodes fail or behave unexpectedly 3. The paper assumes all the nodes begin with same energy this assumption may not be realistic
TU Dresden, 23/01/2007
LEACH
33
Reference
1. Heinzelman Wendi Rabiner, Chandrakasan Anantha, and Balakrishnan Hari. EnergyEfficient Communication Protocol for Wireless Microsensor Networks. In IEEE. Published in the Proceedings of the Hawaii International Conference on System Sciences, January 4-7, 2000, Maui, Hawaii. Heinzelman Wendi Rabiner, Chandrakasan Anantha, and Balakrishnan Hari. An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Transactions On Wireless Communication, Vol. 1, No. 4, October 2002. Handy. M. J, Haase. M, Timmermann. D. Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection. IEEE International Conference on Mobile and Wireless Communications Networks, 2002, Stockholm. Yrjl Juhana. Summary of Energy-Efficient Communication Protocol for Wireless Microsensor Networks, 13th March 2005. Karl Holger, Willig Andreas. Protocol and Architecture for Wireless Sensor Network, John Willey and Sons Ltd, 2005. W. Heinzelman, Application-specific protocol architectures for wireless networks, Ph.D. dissertstion, Mass. Inst. Technol., Cambridge, 2000.
2.
3.
4. 5. 6.
TU Dresden, 23/01/2007
LEACH
34
Acknowledgements
Some of the slides are inspired from following presentations
Tuteja Mukul. Presentation of Energy-Efficient Communication Protocol for Wireless Microsensor Networks. Saket Das, Presentation on LEACH protocol, University of Nebraska-Lincoln.
TU Dresden, 23/01/2007
LEACH
35
TU Dresden, 23/01/2007
LEACH
36
If number of cluster-heads is less than k, some nodes have to transmit very far to reach the cluster head, large global energy. If number of cluster-heads is more than k, distance does not reduce substantially, more cluster heads have to transmit the long haul distances to the base station, hence compression is less.
TU Dresden, 23/01/2007
LEACH
37
LEACH Simulation
TU Dresden, 23/01/2007
LEACH
38