JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
Dynamic Cluster Distribution Routing Protocol For Wireless Sensor
Network
S.K.Padhi P.K.Pattnaik
Dept. of Comp. Sc.& Engg. Dept. of Comp.Sc. & Engg.
KIST KIST
Bhubaneswar,INDIA Bhubaneswar,INDIA
Abstract— Grouping sensor nodes into cluster has been
popularly used in order to achieve the network scalability.
Every cluster needs a leader, and referred as the cluster-head.
Many clustering Schemes for Wireless sensor Networks focus
on the stable clustering techniques for mobile environments.
In this paper, we have proposed an extension to Low Energy
Adaptive Cluster head protocol namely Dynamic Cluster
Distribution Routing Protocol For Wireless Sensor Network in
which cluster heads uses Minimum transmission routing for
transmitting to base station . We have shown the correctness &
effectiveness of our protocol by mathematical simulation
studies.
Keywords- Cluster, Routing Protocol, Minimum
Transmission Energy, Wireless Sensor Network
I. INTRODUCTION
Recent advances in micro-electro-mechanical system
(MEMS) and low power and highly integrated digital
electronics have led to the development of micro sensors
[1,2,3,4].Such sensors are generally equipped with data
processing and communication capabilities. The sensing
circuitry measures ambient condition related to the
environment surrounding the sensor and transforms them
into an electrical signal. Processing such a signal reveals
some properties about objects located and/or events
happening in the vicinity of the sensors. The sensor sends
such collected data, usually via radio transmitted , to a
command center (sink) either directly or through a data
concentration center (a gateway) .The decrease in the size
and cost of sensors, resulting from such technological
advances, has fueled interest in the possible use of large set
of disposable unattended sensors. Such interest has
motivated intensive research in the past few years addressing
the potential of collaboration among sensors in data
gathering and processing and the coordination and
managements of the sensing activity and data flow to the
sink. A natural architecture for such collaborative distributed
sensors is a network with wireless link that can be formed
among the sensors in an ad hoc manner
II. DIRECT BASED AND MINIMUM ENERGY BASED
ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORK
There are many routing protocols that are proposed for
the problem of routing the data in wireless sensor networks.
These routing mechanisms have considered the
83
B.Puthal
Dept. of Comp.Sc. & Engg.
KIST
Bhubaneswar,INDIA
characteristics of sensor nodes along with the application and
architecture requirements
III. A. HIERARCHICAL PROTOCOLS
Similar to other communication networks, scalability is
one of the major design attributes of sensor networks. A
single-tier network can cause the gateway to overload with
the increase in sensors density. Such overload might cause
latency in communication and inadequate tracking of events.
In addition, the single gateway architecture is not Scalable
for a larger set of sensors covering a wider area of interest
since the sensors are typically not capable of long-haul
communication. To allow the system to cope with additional
load and to be able to cover a large area of interest without
degrading the service, networking clustering has been
pursued in some routing approaches. The main aim of
hierarchical routing is to efficiently maintain the energy
consumption of sensor nodes by involving them in multi-hop
communication within a particular cluster and by performing
data aggregation and fusion in order to decrease the number
of transmitted messages to the sink. Cluster formation is
typically based on the energy reserve of sensors and sensor’s
proximity to the cluster head. LEACH [6] is one of the first
hierarchical routing approaches for sensors networks. The
idea proposed in LEACH has been an inspiration for many
hierarchical routing protocols, although some protocols have
been independently developed.
Examples
Low - Energy Adaptive Clustering Hierarchy (LEACH)[6],
Power-Efficient Gathering in Sensor Information Systems
(PEGASIS)[5], Hierarchical-PEGASIS[8], Threshold
sensitive Energy Efficient Sensor Network protocol
(TEEN)[7], Adaptive Threshold sensitive Energy Efficient
sensor Network protocol (APTEEN)[9], Energy-aware
routing for cluster-based sensor networks (Younis et al)[10].
IV. B. LOCATION - BASED PROTOCOLS
Most of the routing protocols for sensor networks require
location information for sensor nodes. In most cases location
information is needed in order to calculate the distance
between two particular nodes so that energy consumption
can be estimated. Since, there is no addressing scheme for
sensor networks like IP addresses and they are spatially
deployed on a region, location information can be utilized in
routing data in an energy efficient way. For instance, if the
region to be sensed is known, using the location of sensors,
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
the query can be diffused only to that particular region which
will eliminate the number of transmission significantly.
Examples
Minimum Energy Communication Network
(MECN)[11], Small Minimum Energy Communication
Network (SMECN)[12], Geographic Adaptive Fidelity
(GAF)[13], Geographic and Energy Aware Routing
GEAR)[14].
V. RELATED WORK
A. LEACH
First, Low Energy Adaptive Clustering Hierarchy
(LEACH) [6]is a clustering-based protocol. LEACH uses
randomized rotation of the of the cluster heads to evenly
distribute the energy load among the sensor in a network.
Once the clusters are constructed, the cluster heads
broadcast , TDMA schedules providing the order of
transmission for members in the cluster. Each node has its
own time slot. It transmits data to the cluster head within its
exclusive time slot. When the last node in the schedule has
transmitted its data, the cluster head will be randomly
elected in the next round. It employs localized coordination
to improve the scalability and balance the energy usage of
the network among all the nodes.
B. TEEN
Threshold sensitive Energy efficient sensor Network
protocol (TEEN)[7] is based on LEACH TEEN has two
additional restrictions. First, when the absolute value of the
sensed attribute is beyond a Hard Threshold (HT). The node
sensing this value must switch on its transmitter and report it.
Second, when a change in the value of the sensed attribute is
larger than a Soft Threshold (ST), It triggers the node to
switch on its transmitter and report the sensed data. A node
will report data only when the sensed value exceeds HT or
the value’s change is larger than ST.
C. PEGASIS
Power-Efficient Gathering in Sensor information System
(PEGASIS ) [5] is a chin-based power efficient protocol
based on LEACH. It assumes that each node must know
location information about all other nodes at first. PAGASIS
starts with the farthest node from the base station. The chain
can be constructed easily by using a greedy algorithm. The
chain leader aggregates data and forwards it to the base
station. In order to balance the over head involved in
communication between the chain leader and the base
station, each node in the chain takes turn to be the leader.
Routing Algorithm is a self-organizing, adaptive
clustering protocol that uses randomization to distribute the
energy load evenly among the sensors in the network. In
Algorithm, the nodes organize themselves into local clusters,
with one node acting as the local base station or cluster-head.
In order to spread this energy usage over multiple nodes, the
cluster-head nodes are not fixed; rather, this position is self-
elected at different time intervals. Each node makes its
decision about whether to be a cluster-head independently of
84
the other nodes in the network and thus no extra negotiation
is required to determine the cluster-heads.
VI. MOTIVATIONS
LEACH protocol works well for networks with smaller
diameter. However for networks having larger diameter it is
not always possible to transmit the data from the cluster head
to the base station. So as the Network diameter increases we
must increase the power of the antenna of the sensor nodes to
transmit data to the base station. Increase in power results in
antennas of greater size which are desirable.
Hence we can extend the LEACH Protocol for
another phase in which the cluster heads will use minimum
transmission energy routing to transmit data to base station.
The cluster heads use other cluster heads for as routers for
MTE routing.
VII. OUR PROPOSED ALGORITHM:
The algorithm is based on LEACH while extending it to
large scale networks. The operation of the proposed
protocol[15,16,17,18,19] is broken up into rounds, where
each round begins with a set-up phase, when the clusters are
organized, followed by a steady state phase, when data
transfers to the base station occur. In order to minimize
overhead, the steady-state phase is long compared to the set-
up phase. Each node that has elected itself a cluster-head for
the current round broadcasts an advertisement message to the
rest of the nodes. For this "cluster-head advertisement" phase
and all cluster heads transmit their advertisement using the
same transmit energy. The non-cluster head nodes must keep
their receivers on during this phase of set-up to hear the
advertisements of all the cluster-head nodes. After this phase
is complete, each non cluster-head node decides the cluster
to which it will belong for this round. This decision is based
on the received signal strength of the advertisement.
Assuming symmetric propagation channels, the cluster-head
advertisement heard with the largest signal strength is the
cluster-head to whom the minimum amount of transmitted
energy is needed for communication. In the case of ties, a
random cluster-head is chosen.This can be processed in the
following criteria’s.
A. . Advertisement Phase:
Initially, when clusters are being created, each node
decides whether or not to become a cluster-head for the
current round. This decision is based on the suggested
percentage of cluster heads for the network (determined a
priori) and the number of times the node has been a cluster-
head so far. This decision is made by the node n choosing a
random number between 0 and 1.If the number is less than a
threshold T(n). the node becomes a cluster-head for the
current round. The threshold is set as:
--------(1)
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 85

E. Pseudo code for proposed Energy Efficient Clustering

Where P is the desired percentage of cluster heads (e.g., Algorithm
P=0.05), r is he current round, and G is the set of nodes that Set-up Phase:
have not been cluster-heads in the last 1/p rounds. Using this /* Cluster head election */
threshold, each node will be a cluster-head at some point for I ε s
within 1/p rounds, During round 0 (1=0), each node has a generate a random number R
probability P of becoming a cluster-head. The nodes that are calculate the threshold T(i)
cluster-heads in round 0 cannot be cluster-heads for the next if R < T (i)
1/p rounds. Thus the probability that the remaining nodes i → SC /*elect itself as a cluster head */
are cluster-heads must be increased, since there are fewer else
nodes that are eligible to become cluster-heads. After (1/p-1) i →SN /*be a non-cluster head */
rounds, T=1 for any nodes that have not yet been cluster- end if
heads, and after 1/p rounds, all nodes are once again eligible end for
to become cluster-heads. In this case, we are assuming that /* Each cluster head estimates energy consumption
all nodes begin with the same amount of energy and being a about current round. */
cluster head removes approximately the same amount of for i ε SC
energy for each node. broadcast the advertisement message
end for
B. Cluster Set-Up Phase
cluster set up phase:
After each node has decided to which cluster it belongs, /*Each non-cluster head select s a cluster head based on
it must inform the cluster-head node that it will be a member maximum energy residue.
of the cluster. Each node transmits this information back to */
the cluster-head again using a CSMA MAC protocol. During for j ε SN
this phase, all cluster-head nodes must keep their receivers receive advertisement message
on. mind = ∞
joinCH = 0
for i ε SC
C. Schedule Creation
if mind> di
The cluster-head node receives all the messages for
nodes that would like to be included in the cluster. Based on joinCH = i
the number of nodes in the cluster, the cluster-head node end jf
creates a TDMA schedule telling each node when it can end for i
transmit. This schedule is broadcast back to the nodes in the join cluster head "join CH"
cluster. end for j
for i ε SC
discover route to the sink and set next hop neighbor
D. Data Transmission end for i
Steady State Phase:
/* Data Transmission with MTE routing*/
Once the clusters are created and the TDMA schedule is for j ε SN
fixed, data transmission can begin. Assuming nodes always transmit sensed data to cluster head “Join CH”
have data to send, they send it during their allocated end for j
transmission time to the cluster head. This transmission uses for i ε SC
a minimal amount of energy (chosen based on the received (receive sensed data from its member of cluster
strength of the cluster-head advertisement). The radio of aggregate data and send it to the next hop neighbor
each non-cluster-head node can be turned off until the node's end for i
allocated transmission time, thus minimizing energy
dissipation in these nodes.The cluster-head node must keep
its receiver on to receive all the data from the nodes in the F. VII.Simulation
cluster. When all the data has been received, the cluster head 1) A. Simulation Environment
node performs signal processing functions to compress the
We had used ns2 a open source network simulator developed
data into a single signal. For example. if the data are audio or
seismic signals, the cluster-head node can beam form the by university of California. Ns2 provides a good support for
individual signals to generate a composite signal. This simulating real time networking problems.We used the MIT
composite signal is sent to the base station. Since the base uAMPS Extensions as our base for implementations.
station is far away, this is a high-energy transmission.
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 86

B. Simulation Results

Figure. 100 node randomly generated network

Figure . Dynamic Cluster Distribution

JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 87

Figure: Dynamic Cluster Distribution at another network state

C. Simulation output table

Table . Simulation Results

JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
G. VIII.Analysis of our work
We had simulated LEACH and MTE and the proposed
routing protocols in ns2.31 network simulator. Ns2
simulator is widely used for network simulation since it
simulates all real time situations. We simulated the
protocols for the random network shown in Figure using
the radio parameters in Table and a computation cost of
5nJ/bit/message to fuse 2000-bit messages while varying
the percentage of total nodes that are cluster heads. Figure
6 shows a 100 node network with nodes places at
randomly generated points. Figures show the cluster
distributions at different states of the network during the
protocol execution with dynamic cluster distribution. The
system can determine a priori, the optimal number of
clusters to have in the system. This will depend on several
parameters, such as the network topology and the relative
costs of computation versus communication. Figure shows
Figure: Normalized power dissipation Vs. % cluster heads
88
how the energy dissipation in the system varies as the
percent of nodes that are cluster-heads is changed, Note
that 0 cluster-heads and 100% cluster heads is the same as
direct communication. From this plot, we find that there
exists an optimal percent of nodes N that should be
cluster-heads. If there are fewer than N cluster heads, some
nodes in the network have to transmit their data very far to
reach the cluster-head, causing the global energy ill the
system to be large. If there are more than cluster heads, the
distance nodes have to transmit to reach the nearest cluster
head does not reduce substantially, yet there are more
cluster-heads that have to transmit data the long-haul
distances to the base station and there is less compression
being performed locally. For our system parameters and
topology, N ==5%.
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG
Figure . Energy Dissipation as the network diameter increases
It is also seen from the results that the time at which
the first nodes dies in proposed protocol is much more
than the time for direct communication. And also due to
randomized rotation of the cluster head the nodes will die
randomly. Hence there will be no large areas in the
network which are not sensed by the sensors. In addition to
reducing energy dissipation, proposed protocol
successfully distributes energy-usage among the nodes in
the network such that the nodes die randomly and at
essentially the same rate.
H. Conclusions:
which uses dynamic clustering in order to distribute
load at different points of time and minimizes the overall
energy dissipation in the system. At different times, each
node has the burden of acquiring data from the nodes in
the cluster, fusing the data to obtain an aggregate signal,
and transmitting this aggregate signal to the base station.
Our protocol is completely distributed, requiring no
control information from the base station, and the nodes do
not require knowledge of the global network in order for
the We had proposed a new cluster based new protocol
which extends LEACH to networks of larger diameter by
using MTE routing for communication of cluster heads to
base station. Our protocol is distributed protocol protocol
to operate.Based on our simulations with network
simulator ns it is shown that our protocol has less total
energy dissipation in the system as the network diameter
increases.
89
I. .References
[1] W. Heinzelman, A. Chandrakasan and H.
Balakrishnan, "Energy-Efficient Communication Protocol
for Wireless Microsensor Networks," Proceedings of the
33rd Hawaii International Conference on System Sciences
(HICSS '00), January 2000.
[2] W. Heinzelman, J. Kulik, and H. Balakrishnan,
"Adaptive Protocols for Information Dissemination in
Wireless Sensor Networks," Proc. 5th ACM/IEEE
Mobicom Conference (MobiCom '99), Seattle, W A,
August, 1999. pp. 174-85.
[3] A.A. Abbasi, M.Younis, "A Survey on clustering
algorithms for wireless sensor networks", Computer
Communications (2007),
doi:10.1016/j.comcom.2007.05.024
[4] Chandrakasan, Amirtharajah, Cho, Goodman,
Konduri, Kulik, Rabiner, and Wang. Design
Considerations for Distributed Microsensor Systems. In
IEEE 1999 Custom Integrated Circuits Conference
(CICC), pages 279-286, May 1999.
[5] I.F. Akyildiz et aI., Wireless sensor networks: a
survey, Computer Networks 38 (2002) 393-422. .
[6] K. Akkaya, M. Younis, A survey on routing
protocols for wireless sensor networks, Elsevier Journal of
Ad Hoc Networks 3 (3) (2005) 325-349
[7] A.D. Amis, R. Prakash, T.H.P. Vuong, D.T.
Huynh, Max-Min D cluster formation in wireless Ad Hoc
networks, in: Proceedings of IEEE INFOCOM, March
2000.
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 8, AUGUST 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 90

[8] A Clustering Scheme for hierarchical Control in

Multi-hop Wireless Networks, by S.Banerjee, S.Khuller.
[9] S. Basagni, Distributed clustering algorithm for ad-
hoc networks, in:Proceedings of the International
Symposium on Parallel Architectures, Algorithms, and
Networks (I-SPAN), Fremantle, Australia, June 1999.
[10] Mohamed Younis, Moustafa Youssef, Khaled
Arisha, "Energy aware routing in cluster based sensor
networks", Proceedings of the 10th IEEE Int.l Symp. On
Modeling, Analysis, & Simulation of Computer &
Telecommunications Systems (MASCOTS.02), IEEE
2002.
[11]NS 2,Network Simulator World Wide
Web,http://www.isi.edu/nsnam/ns/ns-build.html. 2004.
[12)MITuAMPS LEACH ns Extensions.'World Wide
Web,
http://www.ece.rochester.edu/research/wong/code/index.ht
m , 2005.
[13J Performance study of IEEE 802.15.4 using
measurements and simulations by Marina Petrova, Janne
Riihijarvi, Petri Mahonen, and Saverio Labella.
[14] J. Zheng and Myung J. Lee, "A comprehensive
performance study of IEEE 802.15.4," Sensor Network
Operations, IEEE Press, Wiley Interscience, Chapter 4,
page. 218-237,2006.
[15] Maika Halgamuge, Siddeswara Mayura Guru, and
Andrew Jennings ;Energy Efficient Cluster Formation in
Wireless Sensor Networks, In Proceedings of IEEE
International Conference on Telecommunications, IEEE
ICT 2003, IEEE Press.
[16] Yuon Guo and Janise Mcnair; Cost Efficient
Cluster Formation for Wireless Sensor Networks, In
Proceedings of CITSA 2004, Orlando, FL, July 2004.
[17] K. Lahiri, A. Raghunathan, S. Dey, D. Panigrahi,
"Battery - Driven System Design: A new Frontier in Low
Power Design" in Proc. ASP - DAC/ Int. Conf.VLSI
Design,pp 161-167,Jan 2002.
[18] S. Tilak et ai., "A Taxonomy of Wireless
Microsensor Network Models," in ACM Mobile
Computing and Communications Review (MC2R), June
2002.
[19]Alan Mainwaring,Joseph Polastre,Robert
azewczyle,David Culler and John Anderson,”Wireless
Sensor networks for habitat monitoring “ACM
International Workshop on Wireless Sensor Networks and
applications(WSNA ’02),Atlanta,GA,September 2002.