Energy-Efficient Communication Protocol for Wireless

Microsensor Networks

• Introduction
• Radio Model
• Existing Protocols
– Direct Transmission
– Minimum Transmission Energy
– Static Clustering
• LEACH
• Performance Comparison
• Conclusions
EST LAB RESOURSE 1
 Introduction
• LEACH
• (Low-Energy Adaptive Clustering Hierarchy)
• is a routing protocol for wireless sensor networks
in which:
– The base station (sink) is fixed
– Sensor nodes are homogenous
• LEACH conserves energy through:
– Aggregation
– Adaptive Clustering
EST LAB RESOURSE 2
 Radio Model
• Designed around
acceptable Eb/N0
• Eelec = 50nJ/bit
– Energy dissipation for
transmit and receive
• εamp = 100pJ/bit/m2
ETx (k , d )  ( Eelec * k )  ( amp * k * d 2 )
– Energy dissipation for
transmit amplifier ERx (k )  Eelec * k

• k = Packet size
• d = Distance

EST LAB RESOURSE 3

 Existing Routing Protocols
• LEACH is compared against three other
routing protocols:
– Direct-Transmission
• Single-hop
– Minimum-Transmission Energy
• Multi-hop
– Static Clustering
• Multi-hop

EST LAB RESOURSE 4

 Direct-Transmission
• Each sensor node
transmits directly to
the sink, regardless
of distance
• Most efficient when
there is a small
coverage area
and/or high receive
cost
Sensor Status after 180 rounds
with 0.5J/node

EST LAB RESOURSE 5

 Minimum Transmission Energy (MTE)
• Traffic is routed through
intermediate nodes
– Node chosen by transmit
amplifier cost
– Receive cost often ignored
• Most efficient when the
average transmission
distance is large and Eelec is
low Sensor Status after 180 rounds
with 0.5J/node

EST LAB RESOURSE 6

 MTE vs Direct-Transmission
When is Direct-Transmission Better?
Edirect  EMTE when:
Eelec r 2 n

 amp 2
Edirect  k ( Eelec   amp n 2 r 2 )
• High radio operation costs
EMTE  k ((2n  1) Eelec   amp nr 2 ) favor direct-transmission
• Low transmit amplifier costs
For MTE, a node at distance nr requires (i.e. distance to the sink)
n transmits of distance r, and n-1 favor direct transmission
receives • Small inter-node distances
favor MTE

EST LAB RESOURSE 7

MTE vs. Direct-Transmission (cont)

•100-node random network

•2000 bit packets
•εamp = 100pJ/bit/m2

EST LAB RESOURSE 8

 Static Clustering
• Indirect upstream traffic
routing
• Cluster members transmit
to a cluster head
– TDMA
• Cluster head transmits to
the sink
– Not energy-limited
• Does not apply to
homogenous
environments

EST LAB RESOURSE 9

 LEACH
• Adaptive Clustering
– Distributed
• Randomized Rotation
– Biased to balance energy loss
• Heads perform compression
– Also aggregation
• In-cluster TDMA

EST LAB RESOURSE 10

 LEACH: Adaptive Clustering
• Periodic independent self-
election
t1
– Probabilistic
• CSMA MAC used to
advertise
• Nodes select
advertisement with
strongest signal strength
• Dynamic TDMA cycles t2

EST LAB RESOURSE 11

 LEACH: Adaptive Clustering

• Number of clusters determined a

priori
– Compression cost of
5nj/bit/2000-bit message
• “Factor of 7 reduction in energy
dissipation”
– Assumes compression is
cheap relative to
transmission
– Overhead costs ignored

EST LAB RESOURSE 12

 LEACH: Randomized Rotation
• Cluster heads elected every round
– Recent cluster heads disqualified
– Optimal number not guaranteed
• Residual energy not considered
• Assumes energy uniformity
– Impossible with significant network diameters

 P = Desired cluster head  P

 if n  G
percentage 1
 r = Current Round T (n)  1  P * (r mod )
 G = Set of nodes which have not  P
been cluster heads in 1/P 0 otherwise
rounds

EST LAB RESOURSE 13

 LEACH: Operation
• Periodic process
• Three phases per round:
– Advertisement
• Election and membership
– Setup
• Schedule creation
– Steady-State
• Data transmission

EST LAB RESOURSE 14

 LEACH: Advertisement
• Cluster head self-election
– Status advertised broadcast to nearby nodes
• Non-cluster heads must listen to the medium
– Choose membership based on signal strength
• RSSI
• Eb/N0

EST LAB RESOURSE 15

 LEACH: Setup
• Nodes broadcast membership status
– CSMA
• Cluster heads must listen to the medium
• TDMA schedule created
– Dynamic number of time slices

EST LAB RESOURSE 16

 LEACH: Data Transmission
• Nodes sleep until time slice
• Cluster heads must listen to each slice
• Cluster heads aggregate/compress and
transmit once per cycle
• Phase continues until the end of the round
– Time determined a priori

EST LAB RESOURSE 17

 LEACH: Interference Avoidance
• TDMA intra-cluster
• CDMA inter-cluster
– Spreading codes
determined randomly
• Non-overlapping
modulation may be NP-
Complete
– Broadcast during
advertisement phase

EST LAB RESOURSE 18

 LEACH: Hierarchical Clustering
• Not currently implemented
• n tiers of clusters of cluster heads
• Efficient when network diameters are large

EST LAB RESOURSE 19

 Performance: Parameters
• MATLAB Simulator
• 100-node random
network
• Eelec = 50nj/bit
• εamp = 100pJ/bit/m2
• k = 2000 bits

EST LAB RESOURSE 20

Performance: Network Diameter
• LEACH vs. Direct
Transmission
– 7x-8x energy reduction
• LEACH vs. MTE
– 4x-8x energy reduction

EST LAB RESOURSE 21

Performance: Energy and Diameter

LEACH vs. Direct Transmission

MTE vs. Direct Transmission

• LEACH performs in most conditions

• At low diameters and energy costs,
performance gains negligible
• Not always same for costs
•Comparable to MTE for some configurations
LEACH vs. MTE
EST LAB RESOURSE 22
Performance: System Lifetime
• Setup costs ignored
• 0.5J of energy/node
• LEACH more than
doubles network
lifetime
• Static clusters fail as
soon as the cluster
head fails
– Can be rapid

EST LAB RESOURSE 23

Performance: System Lifetime
• Experiments repeated
for different maximum
energy levels
• LEACH gains:
– 8x life expectancy for
first node
– 3x life expectancy for
last node

EST LAB RESOURSE 24

 Performance: Coverage
• LEACH
– Energy distributed evenly
– All nodes serve as cluster
heads eventually
– Deaths randomly distributed
• MTE
– Nodes near the sink die first
• Direct Transmission
– Nodes on the edge die first

EST LAB RESOURSE 25

 Conclusions
• LEACH is completely distributed
– No centralized control system
• LEACH outperforms:
– Direct-Transmission in most cases
– MTE in many cases
– Static clustering in effectively all cases
• LEACH can reduce communication costs by up to 8x
• LEACH keeps the first node alive for up to 8x longer
and the last node by up to 3x longer

EST LAB RESOURSE 26

 Future Work
• Extend ns to simulate LEACH, MTE, and Direct
Transmission
• Include energy levels in self-election
• Implement hierarchical clustering

EST LAB RESOURSE 27

 Areas for Improvement
• LEACH assumes all cluster heads pay the same
energy cost
– Death model incorrect
• Compression may not be as cheap as claimed
– Unclear how much savings are from compression
assumptions and how much from adaptive clustering
• Optimal number of cluster heads must be
determined in simulation, before implementation
• Round durations never specified or explained

EST LAB RESOURSE 28

Improvement on LEACH Protocol
of Wireless Sensor Network
Multihop LEACH
Energy LEACH

EST LAB RESOURSE 29

 Abstract
• Energy-LEACH and multihop –LEACH protocols.
• Energy-LEACH protocol improves the choice method of the
cluster head,
– makes some nodes which have more residual energy as cluster
heads in next round.
• Multihop-LEACH protocol improves communication mode
– from single hop to multi-hop between cluster head and sink.
• Simulation results show that
– energy-LEACH and multihop-LEACH protocols have better
performance than LEACH protocols.

EST LAB RESOURSE 30

• WSN consists of a certain number of smart sensors which form a
multihop Ad Hoc network by radio communications in sensor field.
• WSN aims to perceive in collaborative mode, gather , deal with and send
information to observer in network areas.
• Three factors of WSN
– Sensor
– sensing object
– observer
• WSN protocol stack contains
– physical layer
– data link layer
– network layer
– transport layer
– application layer
• According to network architecture, routing protocols classification
– plane routing
– grade routing
– position routing EST LAB RESOURSE 31
 Introduction (cont…)
• LEACH (Lower Energy Adaptive Clustering Hierarchy) protocol is a
grade routing protocol.
– LEACH protocols is already discussed in detail.
• Sun limin, et. al., and W. Heinzelman, et. al., modified leach protocol,
but it is still faulty and the performance matrixes are complex.
• In this paper, a new modified energy-LEACH protocol is presented
which designs in detail and improves the wang wei, leach protocol
with the help of two simple performance matrixes.
• Multi-hop protocol introduced by Mo Xiaoyan; is quite complex.
• Multihop-LEACH protocol introduced in this paper is :
– Simple
– Great performance
– Especially fit for WSN with restrictive energy.

EST LAB RESOURSE 32

 LEACH protocol
• Main techniques of LEACH protocol include algorithms for:
– distributing cluster forming
– adaptive cluster forming
– cluster header position changing
• The technique of distributing cluster forming ensures self-
organization of most target nodes.
• The adaptive cluster forming and cluster header position
changing algorithms ensure
– to share the energy dissipation fairly among all nodes and
prolong the lifetime of the whole system in the end.

EST LAB RESOURSE 33

 Description of LEACH protocol
• LEACH protocol provides a concept of rounds.
• Each round contains two states:
– cluster setup state
– steady state.
• In cluster setup state
– forms cluster in self-adaptive mode;
• In steady state,
– transfers data.
• The time of transfer state is usually longer than the
time of set up state for saving the protocol payload.
EST LAB RESOURSE 34
Operation Time of LEACH

EST LAB RESOURSE 35

Flow chart of LEACH protocol

EST LAB RESOURSE 36

Cluster Formation of LEACH protocol

EST LAB RESOURSE 37

Different Processes of LEACH protocol

EST LAB RESOURSE 38

Improvements of LEACH protocol
• The criterion of selecting cluster head node
• Multi-hop communication among cluster
heads

EST LAB RESOURSE 39

The criterion of selecting cluster head node

• LEACH protocol randomly selects cluster head

at each round.
– Therefore, some nodes maybe exhaust energy too
quickly due to being selected as cluster head many
times.
• Any modified protocol makes the nodes with
more residual energy have more chance as
cluster head
– prevent the whole network to die too early.
EST LAB RESOURSE 40
 Multi-hop communication among cluster
heads
• Cluster heads directly communicate with sink in
LEACH protocol.
– The energy consumption between cluster head and
sink are greater than energy consumption among
cluster heads, so the cluster head will exhaust energy
soon.
• Multi-hop communication
– can avoid the whole network from dying quickly
– prolong the network lifetime by balancing the energy
consumption among the network.
EST LAB RESOURSE 41
 One Leach Protocol TYPE:is Energy-LEACH protocol
• Energy-LEACH protocol improves the cluster head selection
procedure.
– It makes residual energy of node as the main matrix which decides
• whether these nodes turn into cluster head or not in the next round.
• In first round communication, every node has the same
probability to turn into cluster head.
• n (n=p×N) nodes are randomly selected as cluster heads, and
then, the residual energy of each node is different after one
round communication.
• We select n nodes with more residual energy as cluster
heads in next round communication, and so on until all
nodes are dead.
EST LAB RESOURSE 42
 Energy-LEACH protocol(Conti…)
• Same as the LEACH protocol, energy-LEACH
protocol also divides into many rounds,
• Each round contains following two phases
1. cluster formation phase (Set up phase)
2. cluster steady phase

EST LAB RESOURSE 43

 2.3. Energy-LEACH protocol
• In cluster formation phase,
– each node decides whether to turn into cluster
head or not by comparing with residual energy ；
• Some nodes with more residual energy turn into cluster
heads
– send cluster head information to inform other nodes.
• The other nodes with less residual energy turn into
common nodes,
– send information about joining cluster to a cluster head ；

EST LAB RESOURSE 44

 Flow chart of Energy-LEACH protocol
• In cluster
formation phase,
• the flow chart of
whether a node
turns into cluster
head or a common
node is shown in
figure

EST LAB RESOURSE 45

 Cluster Steady Phase of
E-LEACH protocol
• In cluster steady phase,
– nodes in a cluster send data according to TDMA
table, and cluster heads receive, fuse and send
data to sink.
– After a period of time, the network reforms the
cluster head selection procedure in a new round.

EST LAB RESOURSE 46

 Multihop-LEACH protocol
• Why we Introduce M-LEACH?
– Each cluster head directly communicates with sink
• no matter the distance between cluster head and sink is far or
near in LEACH protocol.
• It will consume lot of energy if the distance is far.
• A further modified LEACH protocol (multihop-LEACH protocol)
– which selects optimal path and adopts multihop between cluster
head and sink is presented here.
• First, multi-hop communication is adopted among cluster heads.
• Then, according to the selected optimal path,
– these cluster heads transmit data to the corresponding
cluster head which is nearest to sink.
• Finally, this cluster head sends data to sink.

EST LAB RESOURSE 47

 Multihop-LEACH protocol
• Multihop-LEACH protocol is
almost the same as LEACH
protocol,
– only makes communication
mode from single hop to multi-
hop between cluster heads and
sink.
– Its multi-hop routing algorithm
within one round is shown in
figure.
Routing of multihop-LEACH protocol
EST LAB RESOURSE 48
 Simulation analysis
• Performances Comparison of
– LEACH protocol
– energy-LEACH protocol
– multihop-LEACH protocol

EST LAB RESOURSE 49

 Performance matrixes
• Network lifetime of WSN is very important due to
restricting energy.
• Here, two matrixes are given to show the state of
network energy consumption.
– Residual energy of all node;
• shows all residual energy of 100 node
– Time of network death for different number of nodes.
• time when the whole network is finally dead under the
condition of a given number of node.

EST LAB RESOURSE 50

 Simulation parameters setting
1. Sensor nodes contain two kinds of nodes:
 sink nodes (no energy restriction)
 common nodes (with energy restriction);
2. Nodes are randomly distributed in a area within 80m×80m,
 and the efficient distance among nodes is 15m;
3. Suppose that every node knows its position, channels between sensor
nodes are ideal, sending energy consumption is the same as receiving
energy consumption,
 energy consumption in each round is 0.05J, and initial energy of each node is 10J;
4. Energy consumption between cluster head and sink is 59 times of the
energy consumption among common nodes;
5. Probability of being cluster head equals 0.04;
6. Each node sends data in every 0.5s, and sends data in every time interval at
a random time by a TDMA slotted MAC protocol;

EST LAB RESOURSE 51

 Simulation parameters setting
7. Network with same number of nodes still may
have different performance due to network
structure.
• In simulation, the network topology is
randomly built each time, and simulation
results are averaged for 3 different network
topologies.

EST LAB RESOURSE 52

Figure: Residual energy of three protocols with 100 nodes

EST LAB RESOURSE 53

 Simulation results
• Figure shows the performance of residual energy of
LEACH protocol, energy-LEACH protocol and
multihop-LEACH protocol.
• Multihop-LEACH protocol has more residual energy
than LEACH and energy-LEACH protocols.
• Energy-LEACH protocol has the same residual energy
as LEACH protocol in the beginning,
– but Energy-LEACH protocol gradually has more residual
energy than LEACH protocol after a certain period of time
(120s for the trial simulation).

EST LAB RESOURSE 54

 Simulation results
• Figure shows the performance
of network death time for
different number of nodes.
– Multihop-LEACH protocol
survives longer than both
energy-LEACH protocol and
LEACH protocol
– Energy-LEACH protocol
survives longer than LEACH
protocol.
– The results show that
• two modified protocols
prolong the network
lifetime as compared
with the commonly
used LEACH protocol.

Figure: Time of network death in different num of

node of three protocols
EST LAB RESOURSE 55
 Conclusion
• Two modified LEACH protocols: energy-LEACH
protocol and multihop-LEACH protocol are
compared
– Energy-LEACH protocol considers residual energy in the
phase of cluster head selection.
– Multihop-LEACH protocol adopts multi-hop
communication between cluster and sink.
• Simulation results show that
– Energy-LEACH and multihop- LEACH protocols have
better performance than LEACH protocol.
EST LAB RESOURSE 56