You are on page 1of 16

Clustering Protocol

for
Sensor Networks

- DILEEP N N
Introduction
 Network : Connecting autonomous systems for
inter-communication
 Sensor : A sensor is a device the produces a
measurable response to a change in physical
condition or chemical condition.
 Protocol : A set of rules for communication
between two entities.
 Cluster of Sensors : A group of sensors closely
grouped.
Clustering Protocol
 A protocol which is framed for the
communication between different nodes in
the cluster is called a clustering protocol.
 Technical Aspects of research
• energy efficiency
• network lifetime
• Scalability
• load balancing etc.
Objectives and Proposal
 Enhanced Energy Efficient Adaptive
Clustering (EEEAC) protocol.
 EEEAC is developed to provide better
efficiency than the existing protocols for
clustered sensor networks.
 Efficiency in terms of energy, scalability,
network lifetime and balanced utilization of
all the nodes.
An Example :
Least Energy Adaptive Cluster
Hierarchy protocol (LEACH)
 LEACH is an architecture for remote
microprocessor networks that combines
the ideas of energy efficient cluster-based
routing and media access together to
achieve good performance in terms of
system lifetime, latency and application
perceived quality.
A Cluster Network
Two Phases of LEACH
 1.Set-Up Phase
• Cluster Formation : forms clusters by using a
distributed algorithm, self-configuring.
• Cluster-head selection : sensors elect
themselves to be cluster-heads at the beginning
of each round ‘r’ that exists for a fixed time
period ‘t ‘.
• Cluster setup : ADV, sensors choose their
cluster- head, cluster heads accept members
and prepares a TDMA.
Phases of Leach
 2. Steady State Operation Phase
 Cluster- head retrieves data from
members, processes and transmits it to
the base station.
 Non-Cluster heads are idle till their TDMA
scheduled time arrives.
Enhanced Energy Efficient
Adaptive Clustering protocol
(EEEAC)
 Working :
 1. Initialize MAXNODE, Maximum energy of
each node.
 2.Define Struct Node for each node and an array
of structures. Each structure keeps the
information for each node in the network.
 3. Distribute all nodes within specified network
span randomly, area wise subdivision of the
network.
 Repeat for ‘n’ number of sub – areas (SA).
 Compare powers of i and j ;
where j = sensors in sub area- {i}
 If power of i>j, i is the cluster-head
 Else, sensor with maximum power among
j is the cluster-head.
 If two sensors have same power, choose
any one among them randomly.
 Follow the rest of the steps of LEACH i.e.
ADV and data collection and transmission
to the base station.
Features of EEEAC :
 Fairly uniform cluster-head distribution.
 Even distribution of energy.
 Effective energy dissipation.
 Enhances the system lifetime over the
previous protocols.
Improvements of EEEAC over
LEACH
 1. The problem of random distribution of
cluster-heads is solved by subdividing the
entire area. The nodes have to
communicate with the cluster-head within
the sub-area and energy required to
communicate with the cluster heads is
within tolerable limits.
 2. The criterion for the formation of cluster-
head is the residual energy, hence the
most energetic sensor is elected as
cluster-head.
 3. The problem of interference among
adjacent clusters is corrected by assigning
a unique CDMA code for each sub-area.
 4. Since each sub-area has an unique and
fixed CDMA code, sensors in a particular
sub-area can use the code directly for
communication. In LEACH, every time a
new cluster-head is elected, it randomly
selects a code and hence has to
broadcast it to the sensors thereby
wasting lot of energy.
Outcomes of Simulation
 From the simulation results it appears that
EEEAC prolongs nodes lifetime over
LEACH because of uniform cluster-head
distribution.
 Energy consumption for transmission of
data is much lower than LEACH in
EEEAC.
Conclusion
With these observations, it is
obvious that EEEAC protocol is
more efficient than any existing
protocols for clustered sensor
networks.

THANK YOU…

You might also like