Energy Efficient Cluster Based

Routing Protocol for Wireless Sensor

Networks
By

Rab Nawaz Khan Jadoon

(MS-Scholar)

Department of Computer Science

COMSATS Institute of Information Technology
University Road, Abbottabad
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Outline
Abstract
Introduction
Related Work
Problem Statement
Proposed Protocol Architecture
Conclusion

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Abstract
Wireless sensor networks are used to collect data
from an inaccessible environment.

They consists of Base Station and sensor nodes.

Nodes are constrained by Energy.

To prolong the network lifetime energy efficient

tech for routing plays an important role.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Abstract
In this paper we propose a new algorithm for
cluster head selection in each cluster for
each round of communication.

The clusters are fixed through out the

network lifetime.

Our proposed work is based on both LEACH and

LEACH-C. (An Hybrid Approach).

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Introduction
WSN are used to collect data from an
inaccessible environment.

The nodes in the network are connected

via Wireless communication channel.

Each node has capability to sense data,

simple computation on that data and send
it to rest of the nodes or to Base Station.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Introduction

The Architecture of WSNs.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Introduction
The Commonly used Applications
of WSNs are:

Military applications
Environmental applications
Health applications
Home applications

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Introduction
Sensor nodes are energy constrained,
once they deployed, it is impossible to
replace or recharge the Battery.

Lot of research have been done on energy

efficient protocol designing, because
energy is a scarce resource for these type
of networks.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Introduction
Wireless sensor network routing protocols can be
classified into three categories.

Direct communication
Flat protocols (Multihop)
Cluster Based routing Protocols.

Our Proposed work is based on Cluster Based

routing protocols.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Introduction
In this paper we consider a Network Model having
Properties.
All Nodes are Static with location and
having same energy level.
All the node have power control capability
to very the transmitted power.
Base Station is rigidly fixed.
Time slot allocation to each node for sensing
and sending data.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Related Work
Main cluster based Routing Protocols are:

LEACH
(Low energy Adaptive Cluster Hierarchy)
LEACH-C
(Low energy Adaptive Cluster Hierarchy-centralized)
PEGASIS
(Power Efficient Gathering in Sensor information
System)

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Related Work
1.LEACH:

In LEACH, the nodes organize themselves into local

clusters.
In each cluster one node acting as a cluster head.
All non-cluster head nodes transmit their data to the
cluster head.
Cluster head node receives data from all the cluster
members, performs signal process on the data (e.g,
data compression and aggregation) and transmits
data to BS.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Related Work
LEACH

The operation of LEACH is divided into

round.
Each round begins with a setup phase and a
steady-state phase
Setup phase:
In the setup phase, the clusters are
organized and cluster heads are selected.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Related Work
LEACH-C
The BS utilizes its global information of the
network to produce better clusters that require
less energy for data transmission.

PEGASIS
It is a chain-based protocol.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Related Work
PEGASIS cont…
In PEGASIS routing protocol, nodes are
organized into a chain using a greedy algorithm
so that each node transmits to and receives from
only one closest node of its neighbors.
In each round, a randomly chosen node from the
chain will transmit the aggregated data to the
BS, thus reducing the per round energy
expenditure compared to LEACH.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Related Work
Currently lot of work have been done on
“Power Aware Routing, according to which
optimal paths are chosen on the basis of
remaining energy at each node along the
path.
That is the path nodes having utmost
energy level to rest of the nodes.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Problem Statement
For cluster formation Base station utilizes
message passing technique.

For forming n clusters in the system, Base

station broadcast n-1 different messages with
different transmission power to sensor field.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Problem Statement

Fig. 1 shows that how the sensor field is divided into n=5 clusters
with broadcasting n-1=4 different messages from base station.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Problem Statement
Cluster Head Selection Strategy
(centralized i.e. base station controlled)
(Low energy node selected as a TCH for
next round of communication).

The base paper [1] utilizes Direct comm.

Strategy for Routing data packet between CH
and Base Station.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Problem Statement
One of the major drawback of the Direct
communication is,
This may not work efficiently especially
when the network diameter is very
large/large scalability.
So in such environment the Direct
Communication fails. So we propose
Multihop communication (CH to CH) to
rout data packet to Base Station (sink).

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Problem Statement

If more layers then

border CH will drain
their energy very
Fig. 2 Direct communication mechanism quickly.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution

The working of proposed protocol is divided

into two phases.

Setup Phase
Data Transfer Phase

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution
1. Setup Phase
Following tasks to be done in the
setup phase!

Cluster Formation
Cluster Head Selection
Setting Up TDMA
Schedule

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution
1. Cluster Formation
Base Station utilizes Message Passing technique for cluster formation.
Following fig. describes the cluster formation mechanism.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution
2. Cluster Head Selection

After the Cluster Formation BS randomly

select one TCH in each cluster.
This is the only involvement of the BS.
TCH is responsible for CH selection.
All the nodes in the cluster send their
energy status to TCH.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Proposed Solution
TCH selects the utmost energy level node
as a CH for that particular round of
communication.
This CH after sending data to BS, sends
out a round start packet to rest of the
nodes and posing now as a TCH for the
next round.
Same procedure will be carried out to rest
of communication.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution
2. Data Transfer Phase
Each node in the cluster after sensing data, send
its data to CH during its pre allocated time slot .
The duration of each slot in which a node send its
data is constant .
For efficient utilizing the energy of each node
except CH will be turned off until its allocated
transmission time.

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Proposed Solution
The CH will awake all the time to receive
data from all the nodes in the cluster.
Changing of the cluster head (CH) will no
effect on the schedule of the cluster
operations.
Multihope communication instead of Direct
communication is utilized, by considering
the scalability factor of the network.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
Proposed Solution
The Fig. describes the graphical depiction of Multihop
communication
between cluster head (CH) and Base Station (Sink).

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)

Radio Energy
Dissipation Model

In this model to transmit l-bit message with a distance d

Meter , ETx is used by the node which is,

Etx (l: d) = Etx-elect (l) + Etx-elect (l: d)

Etx (l: d) = Etx-elect * l + (Eamp * l * d2)

Doctoral Symposium on Research in Computer Science (9-10 Aug 2008

Conclusion
Proposed Protocol reduces the overhead
of dynamic clustering and efficiently
utilizes the energy of whole the system to
extend the network lifetime.
Proposed Protocol indicates the lifetime
of network will be extended and the overall
number of messages received at base
station will be increased.
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)
 Than
ks…
Doctoral Symposium on Research in Computer Science (9-10 Aug 2008)