Scribd
Upload
42 views12 pages

Leach: Ow-Nergy Daptive Lustering Ierarchy

LEACH is a clustering-based protocol that aims to lower energy use in sensor networks. It uses probabilistic clustering, local processing, and dynamic cluster formation to distribute energy load among sensors and extend network lifetime. Nodes self-elect as cluster heads periodically and create TDMA schedules for intra-cluster communication, using CDMA for inter-cluster transmissions.

Uploaded by

murlak37
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
42 views12 pages

Leach: Ow-Nergy Daptive Lustering Ierarchy

LEACH is a clustering-based protocol that aims to lower energy use in sensor networks. It uses probabilistic clustering, local processing, and dynamic cluster formation to distribute energy load among sensors and extend network lifetime. Nodes self-elect as cluster heads periodically and create TDMA schedules for intra-cluster communication, using CDMA for inter-cluster transmissions.

Uploaded by

murlak37
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

4.3.

1
LEACH
Low-Energy Adaptive Clustering Hierarchy

1
LEACH
 LEACH (Low-Energy Adaptive Clustering Hierarchy), a cluste
ring-based protocol that minimizes energy dissipation in sensor
networks.
 LEACH outperforms classical clustering algorithms by using a
daptive clusters and rotating cluster-heads, allowing the energy
requirements of the system to be distributed among all the sens
ors.
 LEACH is able to perform local computation in each cluster to
reduce the amount of data that must be transmitted to the base s
tation.
 LEACH uses a CDMA/TDMA MAC to reduce inter-cluster an
d intra-cluster collisions.

2
LEACH (cont.)
 Sensors elect themselves to be local cluster-heads at a
ny given time with a certain probability.
 Each sensor node joins a cluster-head that requires the
minimum communication energy.
 Once all the nodes are organized into clusters, each cl
uster-head creates a transmission schedule for the nod
es in its cluster.
 In order to balance the energy consumption, the cluste
r-head nodes are not fixed; rather, this position is self-
elected at different time intervals.

3
LEACH
100 m
叢集區

觀測區域

~100m

Sensor (Non Cluster Head)


Sensor (Cluster Head)
Initial Data
Aggregated Data

4 Base Station
LEACH: Adaptive Clustering
 Periodic independent self-election
 Probabilistic
 CSMA MAC used to advertise
 Nodes select advertisement with strongest signal strength
 Dynamic TDMA cycles

All nodes marked with a given symbol belong to the same cluster, and
the cluster head nodes are marked with a ●.
5
Algorithm
 Periodic process
 Two phases per round:
 Setup phase
 Advertisement: Execute election algorithm
 Members join to cluster
 Cluster-head broadcasts schedule

 Steady-State phase
 Data transmission to cluster-head using TDMA
 Cluster-head transfers data to BS (Base Station)

6
Algorithm (cont.)
Fixed-length cycle

Setup phase Steady-state phase

Time slot Time slot Time slot


1 2 3

Advertisement phase Cluster setup phase Broadcast schedule

Self-election of cluster
heads Members Cluster head Broadcast
Cluster heads compete compete with CDMA code to members
with CSMA CSMA
7
Algorithm Summary
 Set-up phase
 Node n choosing a random number m between 0 and 1
 If m < T(n) for node n, the node becomes a cluster-head where

 P
 if n  G
T ( n )   1  P [r * mod(1/ P )]
0 otherwise ,

 where P = the desired percentage of cluster heads (e.g., P= 0.05), r=the c


urrent round, and G is the set of nodes that have not been cluster-heads in
the last 1/P rounds. Using this threshold, each node will be a cluster-head
at some point within 1/P rounds. During round 0 (r=0), each node has a p
robability P of becoming a cluster-head.
8
Algorithm Summary (cont.)
 Set-up phase
 Cluster heads assign a TDMA schedule for their members w
here each node is assigned a time slot when it can transmit.
 Each cluster communications using different CDMA codes t
o reduce interference from nodes belonging to other clusters.
 TDMA intra-cluster
 CDMA inter-cluster
 Spreading codes determined randomly
 Broadcast during advertisement phase

9
Algorithm Summary (cont.)
 Steady-state phase
 All source nodes send their data to their cluster heads
 Cluster heads perform data aggregation/fusion through local
transmission
 Cluster heads send aggregated data back to the BS using a si
ngle direct transmission

10
An Example of a LEACH Network
 While neither of these diagrams is the optimum scenario, the se
cond is better because the cluster-heads are spaced out and the
network is more properly sectioned

Good case scenario Bad case scenario

Node
Cluster-Head Node
X Node that has been cluster-head in the last 1/P rounds
11 Cluster Border
Conclusions
 Advantages
 Increases the lifetime of the network
 Even drain of energy
 Distributed, no global knowledge required
 Energy saving due to aggregation by CHs

 Disadvantages
 LEACH assumes all nodes can transmit with enough power t
o reach BS if necessary (e.g., elected as CHs)
 Each node should support both TDMA & CDMA
 Need to do time synchronization
 Nodes use single-hop communication

12

You might also like