ENERGY EFFICIENT SEARCH

PROTOCOL By: Utsav Kakkad, M.tech

student, VIT University, Vellore
WHAT IS A CENTRALIZED ROUTING PROTOCOL?
It is a routing protocol in which the nodes have a complete knowledge of the network
topology.
It is the central node which decides the routes to be taken while going from one node
to another
All the state information is sent to the central node
Very energy intensive because the complete network information has to be sent to a
central node
WHAT IS A SEMI-CENTRALIZED ROUTING
PROTOCOL?
A node that is following semi-centralised routing algorithm has knowledge of only the
region of the network that concerns it.
Centralized routing protocols are much more energy intensive since the energy
expended to make a node aware of the status of the complete network is quite high.
In centralised WSN routing all the sensor nodes directly send their data to the base
station.
In semi-centralised WSN routing the sensor nodes are divided into clusters.
Each cluster elects a cluster head.
It is the cluster head that transmits the information that it collects from the sensor
nodes to the base station.
SEARCH PROTOCOL
It is a cluster based semi-centralised routing protocol in wireless sensor networks
A set of improvements over LEACH protocol which is the first cluster based routing
protocol
An unfavourable scenario occurring in LEACH was of no cluster head emerging during
a round of operation
SEARCH protocol avoids this by means of a refined G value updating rule
SEARCH thus assures an optimal number of cluster heads per round of operation
FLOWCHART OF THE SEARCH PROTOCOL
PROBLEMS ASSOCIATED WITH WSN ROUTING
PROTOCOLS LIKE LEACH
The number of dead nodes is too high
The average residual energy becomes zero all too quickly (within 15-20 rounds) i.e.
the network lifetime is found to be very short
Thus, we need Energy Efficiency in WSN routing so that a majority of the sensor
nodes remain alive till the end of the rounds of operation
WHY ENERGY EFFICIENCY?
Energy efficiency serves a two fold purpose:
Increases the network lifetime
Reduces the number of dead nodes since energy efficiency would mean a lesser
number of nodes would exhaust their energy and become dead
The reduction in the number of dead nodes is the reason why the network lifetime is
extended
A majority of the nodes remain functional by the end of the rounds of operation in
case of an energy efficient SEARCH protocol implementation in WSN routing
protocols
REFINED G VALUE UPDATING RULE FOLLOWED IN
SEARCH
REFINED G VALUE UPDATING RULE FOLLOWED IN
SEARCH
SEARCH protocol updates the G value when required so that there exist a sufficient
number of cluster head candidates
The number of sensor nodes having a non zero G value(t) is compared to the optimal
number of cluster heads(k)
If a node has a zero or less than zero G value, it can not be elected as a cluster head
If t<k , t candidates are selected as cluster heads and G value of the remaining
nodes is updated
Remaining k-t candidates are chosen from among the nodes whose G value has been
updated
REFINED G VALUE UPDATING RULE FOLLOWED IN
SEARCH CONTD.
If t is found to be greater than k , k cluster heads are immediately picked
CHANGES PROPOSED TO THE ORIGINAL SEARCH
PROTOCOL
One of the changes proposed is that only advanced nodes are eligible to be a
cluster head.
Advanced nodes have a greater amount of initial energy
The transmission of data to the sink(base station) would consume a great amount of
energy
The election of advanced nodes only as a cluster head would reduce the number of
dead nodes in the network
Further, the partitioning of the network into separate clusters serves to increase the
energy efficiency and fault tolerance of the network as well as increasing the
network lifetime.
PROPOSED TOPOLOGY
RESULTS & CONCLUSIONS
The average residual energy of the proposed topology varies slightly as the rounds
progress compared to the random clustering case
 The number of dead nodes shows a sharp increase in case of the random clustering
case (non partitioned case) compared to the proposed topology.
Packets are sent to the Base station almost every round in the proposed topology
Packets are sent to the CH almost every round in the proposed topology whereas
they are zero for the random topology
Cluster Head candidates are found almost every round in the proposed topology
which is desirable since it is the cluster heads that collect the data from the sensor
nodes and send it to the sink.
AVERAGE RESIDUAL ENERGY PER ROUND
NUMBER OF DEAD NODES PER ROUND
PACKETS SENT TO THE BASE STATION PER ROUND
PACKETS TO CLUSTER HEADS
NUMBER OF CLUSTER HEAD CANDIDATES PER
ROUND
NETWORK LIFETIME
Network Lifetime is the time at which the first sensor node of the wireless sensor
network becomes dead since to lose a node means loosing some of the functionalities
of the wireless sensor network
In case of random clustering, we observe the first dead node occurs at the sixth round
In case of the topology proposed the first dead node occurs in the 24th round
CONCLUSIONS
Higher residual energy is observed throughout all the rounds of operation in the
proposed topology owing to a reduction in distance to the base station which results
in energy being dissipated proportional to d2 throughout the WSN
This higher residual energy results in the reduction in the number of dead nodes
Further, this is what ensures packets being sent to the base station as well as cluster
heads per round and ensures a cluster head candidate per round.
The network lifetime of the proposed topology is also longer
REFERENCES
1. SEARCH: A Stochastic Election Approach for Heterogeneous Wireless Sensor
Networks : in-Yi Wang, Jie Ding, Wan-Pei Chen, and Wen-Qiang Guan
2. An Energy Efficient Fuzzy Cluster Head Selection Algorithm for WSNs: Jin
Wang, Junming Niu, Kai Wang, Wei Liu
3. Extending the Lifetime of Wireless Sensor Networks with Threshold Sensitive
Stochastic Election Approach: Indrani Chakraborty
4. Energy-Efficient Communication Protocol forWireless Microsensor
Networks:Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari
Balakrishnan
REFERENCES
5.”An Energy Efficient Fuzzy Cluster Head Selection Algorithm for WSNs”: Jin Wang
,Junming Niu , Kai Wang and Wei Liu
6.”Energy Efficient Clustering Scheme for Prolonging the Lifetime of Wireless Sensor
Network With Isolated Nodes”: Jenq-Shiou Leu ; Tung-Hung Chiang ; Min-Chieh Yu ; Kuan-
Wu Su
7."Research on the optimal number of cluster heads of wireless sensor networks based
on Multi hop – LEACH":Zhichao Qin, Zheng Zhou ,
Xiaochuan Zhao
8.”Clustering Analysis in Wireless Sensor Networks: The Ambit of Performance Metrics
and Schemes Taxonomy”: Asim Zeb,A. K. M.Muzahidul Islam,Mahdi Zareei,Ishtiak
AlMamoon,Nafees Mansoor, Sabariah Baharun, Yoshiaki Katayama,and Shozo Komaki
REFERENCES
9.”Particle Swarm Optimization-Based Unequal and Fault Tolerant Clustering
Protocol for Wireless Sensor Networks” :Tarunpreet Kaur and Dilip Kumar
10.”LEACH Partition Topology for
Wireless Sensor Network”: M. Udin Harun Al Rasyid1, Bih-Hwang Lee, Iwan Syarif,
Mokhammad Muqoffi Arkham
11.”Energy-Efficient Partitioning Clustering Algorithm for Wireless Sensor
Network”: Koffi V. C. Kevin de Souza, Catherine Almhana1, Philippe Fournier-
Viger,Jalal Almhana
12.”An Energy Efficient Regional Partitioned Clustering Routing Algorithm for
Wireless Sensor Networks”: Cuiqin Duan, Jingjing sun, Duan Zhou, Jianxian Zhan