EFFICIENT

CLUSTER HEAD
SELECTION IN
LEACH ROUTING
PROTOCOL FOR
WSNs
Project Members:
Muhammad Aamir
Waqar Ahmad
Umer Javed
Supervised by:
Dr. Ibrar Ali Shah
 2

CONTENTS:
 Wireless sensor networks
 Routing protocol
 Types of Routing Protocol
1. Hierarchical routing protocol.
2. Location Based.
3. Data Centric.
 LEACH(low energy adaptive clustering hierarchy).
 LEACH algorithm.
 Why efficient cluster head selection is important?
 Our proposed protocol
 Results and conclusion
 3

WIRELESS SENSOR NETWORKS:

 “A Wireless sensor network (WSN) is a wireless
network consisting of distributed autonomous
devices using sensors to monitor physical or
environmental conditions such as
temperature, sound, vibration, pressure,
motion or pollutants at different locations.”

 Formed by hundreds or thousands of motes

that communicate with each other and pass
data along from one to another

 Research done in this area mostly focus on

energy and power related issues .
 4

WSNs COMMUNICATION ARCHITECTURE:

 5

WSN ROUTING PROTOCOLS

Three types of routing protocol
 Data Centric Routing Application specific
e.g GOSSIPING, SPIN, RUMOR
 Hierarchical Routing Groups of sensor
nodes into cluster e.g LEACH, TEEN.
 Location Based Routing Each node should
know about its location by some means
e.g GEAR, Min-hop, Map.
 6

LEACH AN INTRODUCTION…
 LEACH stands for Low-Energy Adaptive
Clustering Hierarchy.
 First introduced by Wendi Rabiner
Heinzelman in 2000.
 It is a basic hierarchical routing protocol
 7

LEACH AN
INTRODUCTION….(Cont)
 TheLEACH 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 WORKING PHASES

 TheLEACH network has two phases: the
set-up phase and the steady-state

 The Set-Up Phase

 Where cluster-heads are chosen
 The Steady-State
 Thecluster-heads are maintained
 When data is transmitted between nodes
 9

CLUSTER HEAD SELECTION

 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

 REMEMBER: The goal of leach protocol is

to increase the life time of the network
10
 11

WHY EFFICIENT CLUSTER HEAD

SELECTION IS IMPORTANT:
 In Wireless Sensor Network, sensor node’s life
time is the most critical parameter. Many
researches on these lifetime extension are
motivated by LEACH scheme, which by
allowing rotation of cluster head role among
the sensor nodes tries to distribute the energy
consumption over all nodes in the network.
 Selection of cluster head for such rotation
greatly affects the energy efficiency of the
network.
Direct Communication
Protocol
BS
Clustering
BS
 14

ISSUES IN CLUSTER HEAD

SELECTION:
 The high consumption of energy is due to
the forwarding the aggregated data by
CHs to the BS.
 Defined threshold for CH selection does not
consider node remaining energy while
selecting CHs. Therefore, if less energy
nodes become CHs ,then they will die
before leaf nodes and the cluster network
will be of no use.
 Selecting CHs in each round drain out
energy of sensor nodes.
 15

Comparison of LEACH and its

modified Protocols
 We have studied different modified protocols
of LEACH and compared them based on
certain parameter to find the best routing
Protocol.
 These are
 LEACH
 LEACH-C
 LEACH-B
 TB-LEACH
 MR-LEACH
 16

Our Proposed Model (EE-

LEACH)
CHs selection in the proposed EE-LEACH
protocol consists of the following two
phases:
 1. CH selection phase.
 2. Re-clustered CH selection phase.
 17

Cluster Head selection

‘n’ random number between 0 and 1

‘P’ Probability of node to become cluster head.
‘Er’ remaining energy of node
‘r’ number of round.
 18

Re-clustered CH selection
phase
 Inthe re-clustered CHs selection phase,
the proposed algorithm checks whether
the energy of nodes selected as CHs in
previous round is greater than the defined
threshold.
 Those CHs, selected in the preceding
round, which have greater energies than
a defined threshold, will be retained as
the CHs for the next round
 19

Clusters distributions
 20

Dead Nodes in LEACH and EE-

LEACH
 21

Alive nodes in LEACH and EE-

LEACH