Basic Architecture of clustering

protocols
LEACH protocol Architecture

Randomized rotation of cluster heads among the sensors

 All non-cluster head nodes transmit data to their cluster head
 CH receives this data and performs signal processing
functions on the data and transmits data to the BS
 Basic Architecture of LEACH
CH
In the preceding slide it is the cluster heads(CH) that are
responsible for transmitting the data sensed to the base station

However, LEACH suffers from the following problems:

It is possible that all nodes will die off during the operation of the
LEACH
No nodes are selected as cluster heads

SEARCH follows a similar architecture albeit with a few

improvements which prevents the situation of no cluster heads
emerging among the sensor nodes
Shortcomings of LEACH and
Shortcomings of LEACH
associated protocols

Fail to prolong the round of half alive nodes surviving i.e. the stable period

Fail to reduce the duration of the weak sensing period during which there
is a sharp deterioration of the sensing ability owing to the spreading blind
areas

No cluster head emerges during a round and thus, no data transmitted to
the base station

It has been further observed that the number of live nodes decreases per
round whereas the number of dead nodes increases till all nodes in the
topology are covered
Contd.
Improvements in LEACH that lead to SEARCH protocol


SEARCH tries to prevent the scenario occurring in LEACH
and LEACH-like protocols of no cluster head emerging
during a round

Further, it further gives an assurance of an optimal number
of cluster heads per round
It is to be noted that SEARCH protocol is simulated using a
Heterogeneous Environment that is nodes have different initial energy.

Normal nodes collect data and transmit to a cluster head.

Advanced nodes are nodes having more initial energy than the rest.

More specifically, the advanced nodes have initial energy as Eo(1+α):

where Eo is the initial energy(assumed to be 0.1 in simulation) and α is
the additional energy factor.

SEARCH is also a clustering protocol like LEACH therefore it also has

clusters of sensor nodes and a cluster head in each sensor node
cluster that is responsible for collecting data from sensor nodes and
transmitting it to the sink(base station).
Simulation Parameters
●
X and y dimensions of the field:150 X 150
●
Number of nodes: 300
●
Number of cluster heads(assumed beforehand):8
●
Maximum Number of rounds:750
●
Message size in bits :2000
●
Initial Energy of Sensor Nodes: 0.1 Js
Average Residual Energy vs
Round Number
Number of Dead Nodes vs Round
Number
Count of CHs per round
Simulation Parameters
Number of Nodes in the space: 300
X & Y dimensions of space/field:150 X 150
Initial Energy of the sensor node: 0.1 Joules
Message size in bits:2000
Sink(base station) position: 150 X 150
Maximum number of rounds: 400
●
Initial Energy of Sensor Nodes: 0.1 J
Average Residual Energy vs
Round Number
Number of Dead Nodes vs Round
Number
Count of CHs per round
Simulation Parameters
●
X and y dimensions of the field:150 X 150
●
Number of nodes: 300
●
Number of cluster heads(assumed beforehand):10
●
Maximum Number of rounds:200
●
Message size in bits :2000
●
Initial Energy of Sensor Nodes: 0.1 J
Average Residual Energy vs
Round Number
Number of Dead Nodes vs Round
Number
Count of CHs per round
Simulation Parameters
●
250 rounds
Average Residual Energy vs
Round Number
Number of Dead Nodes vs Round
Number
Count of CHs per round
Simulation Parameters
●
Max no. Of rounds : 300
Count of Chs per round
Number of Dead Nodes vs Round
Number
Average Residual Energy vs
Round Number
Simulation Parameters
●
Maximum number of rounds : 150
●
Initial Energy of the sensor nodes: 0.1
●
Alpha = 2 & Beta = 3
Average Residual Energy vs
Round Number
Number of Dead Nodes vs Round
Number
Count of Chs per round
Shortcomings of the CH selection
protocol followed by SEARCH
●
Based on my simulations, even though the SEARCH protocol selects a
cluster head for every round , it appears to select it every 5 to 6 rounds
●
One of the major advantages of the SEARCH protocol is that, unlike
LEACH, all the sensor nodes do not die off ,this allows the election of a
cluster head every round and hence data reaching the destination
●
SEARCH protocol therefore does not have the problem of no CH being
elected during a round
●
Therefore data always reaches the end destination
Network Lifetime in WSN
● the time at which the first network node runs out of energy to send a packet, because
to lose a node could mean that the network could lose some functionalities.
● normal nodes collect data and transmit to a cluster head
● advanced nodes are nodes having more initial energy then the rest
● weak sensing period, the rounds cover from half alive nodes surviving to the end of
WSNs operating round or the entire WSN operating period. I need to look into this
● Thats why the advanced nodes have an initial energy of (1+α)Eo where Eo is the initial
energy of the normal nodes