Dynamic Cluster Distribution Routing Protocol For Wireless Sensor Network

8/9/2019 Dynamic Cluster Distribution Routing Protocol For Wireless Sensor Network

1/8

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

Dynamic Cluster Distribution Routing Protocol For Wireless Sensor

Network

S.K.Padhi P.K.Pattnaik B.Puthal

Dept. of Comp. Sc.& Engg. Dept. of Comp.Sc. & Engg. Dept. of Comp.Sc. & Engg.

KIST KIST KIST

Bhubaneswar,INDIA 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 fortransmitting to base station . We have shown the correctness &

effectiveness of our protocol by mathematical simulation

studies.

Keywords- Cluster, Routing Protocol, MinimumTransmission Energy, Wireless Sensor Network

I. INTRODUCTION

Recent advances in micro-electro-mechanical system(MEMS) and low power and highly integrated digitalelectronics 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 theenvironment surrounding the sensor and transforms theminto an electrical signal. Processing such a signal revealssome properties about objects located and/or eventshappening in the vicinity of the sensors. The sensor sendssuch collected data, usually via radio transmitted , to acommand center (sink) either directly or through a dataconcentration center (a gateway) .The decrease in the sizeand cost of sensors, resulting from such technologicaladvances, has fueled interest in the possible use of large setof disposable unattended sensors. Such interest hasmotivated intensive research in the past few years addressingthe potential of collaboration among sensors in datagathering and processing and the coordination and

managements of the sensing activity and data flow to thesink. A natural architecture for such collaborative distributedsensors is a network with wireless link that can be formedamong the sensors in an ad hoc manner

II. DIRECT BASED AND MINIMUM E NERGY BASEDROUTING PROTOCOLS FORWIRELESS SENSORNETWORK

There are many routing protocols that are proposed forthe problem of routing the data in wireless sensor networks.These routing mechanisms have considered the

characteristics of sensor nodes along with the application andarchitecture requirements

III. A.HIERARCHICAL PROTOCOLS

Similar to other communication networks, scalability isone of the major design attributes of sensor networks. Asingle-tier network can cause the gateway to overload withthe increase in sensors density. Such overload might causelatency in communication and inadequate tracking of events.In addition, the single gateway architecture is not Scalablefor a larger set of sensors covering a wider area of interestsince the sensors are typically not capable of long-haulcommunication. To allow the system to cope with additionalload and to be able to cover a large area of interest withoutdegrading the service, networking clustering has been

pursued in some routing approaches. The main aim ofhierarchical routing is to efficiently maintain the energyconsumption of sensor nodes by involving them in multi-hopcommunication within a particular cluster and by performingdata aggregation and fusion in order to decrease the numberof transmitted messages to the sink. Cluster formation istypically based on the energy reserve of sensors and sensors

proximity to the cluster head. LEACH [6] is one of the firsthierarchical routing approaches for sensors networks. Theidea proposed in LEACH has been an inspiration for manyhierarchical routing protocols, although some protocols have

been independently developed.ExamplesLow - Energy Adaptive Clustering Hierarchy (LEACH)[6],Power-Efficient Gathering in Sensor Information Systems(PEGASIS)[5], Hierarchical-PEGASIS[8], Thresholdsensitive Energy Efficient Sensor Network protocol(TEEN)[7], Adaptive Threshold sensitive Energy Efficientsensor Network protocol (APTEEN)[9], Energy-awarerouting for cluster-based sensor networks (Younis et al)[10].

IV. B.LOCATION - BASED PROTOCOLS

Most of the routing protocols for sensor networks requirelocation information for sensor nodes. In most cases locationinformation is needed in order to calculate the distance

between two particular nodes so that energy consumptioncan be estimated. Since, there is no addressing scheme forsensor networks like IP addresses and they are spatiallydeployed on a region, location information can be utilized inrouting data in an energy efficient way. For instance, if theregion to be sensed is known, using the location of sensors,


2/8


the query can be diffused only to that particular region whichwill 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. LEACHFirst, Low Energy Adaptive Clustering Hierarchy

(LEACH) [6]is a clustering-based protocol. LEACH usesrandomized rotation of the of the cluster heads to evenlydistribute the energy load among the sensor in a network.Once the clusters are constructed, the cluster heads

broadcast , TDMA schedules providing the order oftransmission for members in the cluster. Each node has itsown time slot. It transmits data to the cluster head within itsexclusive time slot. When the last node in the schedule has

transmitted its data, the cluster head will be randomlyelected in the next round. It employs localized coordinationto improve the scalability and balance the energy usage ofthe network among all the nodes.

B. TEENThreshold sensitive Energy efficient sensor Network

protocol (TEEN)[7] is based on LEACH TEEN has twoadditional restrictions. First, when the absolute value of thesensed attribute is beyond a Hard Threshold (HT). The nodesensing this value must switch on its transmitter and report it.Second, when a change in the value of the sensed attribute islarger than a Soft Threshold (ST), It triggers the node toswitch on its transmitter and report the sensed data. A node

will report data only when the sensed value exceeds HT orthe values change is larger than ST.

C. PEGASISPower-Efficient Gathering in Sensor information System

(PEGASIS ) [5] is a chin-based power efficient protocol based on LEACH. It assumes that each node must knowlocation information about all other nodes at first. PAGASISstarts with the farthest node from the base station. The chaincan be constructed easily by using a greedy algorithm. Thechain leader aggregates data and forwards it to the basestation. In order to balance the over head involved incommunication between the chain leader and the basestation, each node in the chain takes turn to be the leader.

Routing Algorithm is a self-organizing, adaptiveclustering protocol that uses randomization to distribute theenergy load evenly among the sensors in the network. InAlgorithm, 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, thecluster-head nodes are not fixed; rather, this position is self-elected at different time intervals. Each node makes itsdecision about whether to be a cluster-head independently of

the other nodes in the network and thus no extra negotiationis required to determine the cluster-heads.

VI. MOTIVATIONS

LEACH protocol works well for networks with smallerdiameter. However for networks having larger diameter it isnot always possible to transmit the data from the cluster head

to the base station. So as the Network diameter increases wemust increase the power of the antenna of the sensor nodes totransmit data to the base station. Increase in power results inantennas of greater size which are desirable.

Hence we can extend the LEACH Protocol foranother phase in which the cluster heads will use minimumtransmission energy routing to transmit data to base station.The cluster heads use other cluster heads for as routers forMTE routing.

VII. OURPROPOSED ALGORITHM:

The algorithm is based on LEACH while extending it tolarge scale networks. The operation of the proposed

protocol[15,16,17,18,19] is broken up into rounds, whereeach round begins with a set-up phase, when the clusters areorganized, followed by a steady state phase, when datatransfers to the base station occur. In order to minimizeoverhead, the steady-state phase is long compared to the set-up phase. Each node that has elected itself a cluster-head forthe current round broadcasts an advertisement message to therest of the nodes. For this "cluster-head advertisement" phaseand all cluster heads transmit their advertisement using thesame transmit energy. The non-cluster head nodes must keeptheir receivers on during this phase of set-up to hear theadvertisements of all the cluster-head nodes. After this phaseis complete, each non cluster-head node decides the clusterto which it will belong for this round. This decision is basedon the received signal strength of the advertisement.Assuming symmetric propagation channels, the cluster-headadvertisement heard with the largest signal strength is thecluster-head to whom the minimum amount of transmittedenergy is needed for communication. In the case of ties, arandom cluster-head is chosen.This can be processed in thefollowing criterias.

A. . Advertisement Phase:Initially, when clusters are being created, each node

decides whether or not to become a cluster-head for thecurrent round. This decision is based on the suggested

percentage of cluster heads for the network (determined apriori) and the number of times the node has been a cluster-head so far. This decision is made by the node n choosing arandom number between 0 and 1.If the number is less than athreshold T(n). the node becomes a cluster-head for thecurrent round. The threshold is set as:

--------(1)


3/8


Where P is the desired percentage of cluster heads (e.g.,P=0.05), r is he current round, and G is the set of nodes thathave not been cluster-heads in the last 1/p rounds. Using thisthreshold, each node will be a cluster-head at some pointwithin 1/p rounds, During round 0 (1=0), each node has a

probability P of becoming a cluster-head. The nodes that arecluster-heads in round 0 cannot be cluster-heads for the next1/p rounds. Thus the probability that the remaining nodesare cluster-heads must be increased, since there are fewernodes that are eligible to become cluster-heads. After (1/p-1)rounds, T=1 for any nodes that have not yet been cluster-heads, and after 1/p rounds, all nodes are once again eligibleto become cluster-heads. In this case, we are assuming thatall nodes begin with the same amount of energy and being acluster head removes approximately the same amount ofenergy for each node.

B. Cluster Set-Up PhaseAfter each node has decided to which cluster it belongs,

it must inform the cluster-head node that it will be a member

of the cluster. Each node transmits this information back tothe cluster-head again using a CSMA MAC protocol. Duringthis phase, all cluster-head nodes must keep their receiverson.

C. Schedule CreationThe cluster-head node receives all the messages for

nodes that would like to be included in the cluster. Based onthe number of nodes in the cluster, the cluster-head nodecreates a TDMA schedule telling each node when it cantransmit. This schedule is broadcast back to the nodes in the

cluster.

D. Data TransmissionOnce the clusters are created and the TDMA schedule is

fixed, data transmission can begin. Assuming nodes alwayshave data to send, they send it during their allocatedtransmission time to the cluster head. This transmission usesa minimal amount of energy (chosen based on the receivedstrength of the cluster-head advertisement). The radio ofeach non-cluster-head node can be turned off until the node'sallocated transmission time, thus minimizing energydissipation in these nodes.The cluster-head node must keep

its receiver on to receive all the data from the nodes in thecluster. When all the data has been received, the cluster headnode performs signal processing functions to compress thedata into a single signal. For example. if the data are audio orseismic signals, the cluster-head node can beam form theindividual signals to generate a composite signal. Thiscomposite signal is sent to the base station. Since the basestation is far away, this is a high-energy transmission.

E. Pseudo code for proposed Energy Efficient ClusteringAlgorithm

Set-up Phase:/* Cluster head election */for I sgenerate a random number Rcalculate the threshold T(i)if R < T (i)i SC /*elect itself as a cluster head */elseiSN /*be a non-cluster head */end ifend for/* Each cluster head estimates energy consumptionabout current round. */for i SC

broadcast the advertisement messageend forcluster set up phase:/*Each non-cluster head select s a cluster head based on

maximum energy residue.*/for j SNreceive advertisement messagemind =

joinCH = 0for i SC

if mind> di

joinCH = iend jfend for i

join cluster head "join CH"

end for jfor i SCdiscover route to the sink and set next hop neighborend for iSteady State Phase:/* Data Transmission with MTE routing*/for j SNtransmit sensed data to cluster head Join CHend for jfor i SC(receive sensed data from its member of clusteraggregate data and send it to the next hop neighborend for i

F. VII.Simulation1) A. Simulation Environment

We had used ns2 a open source network simulator developedby university of California. Ns2 provides a good support for

simulating real timenetworking problems.We used the MITuAMPS Extensions as our base for implementations.


4/8


B. Simulation Results

Figure. 100 node randomly generated network

Figure . Dynamic Cluster Distribution


5/8


Figure: Dynamic Cluster Distribution at another network state

C. Simulation output table

Table . Simulation Results


6/8


G. VIII.Analysis of our workWe had simulated LEACH and MTE and the proposed

routing protocols in ns2.31 network simulator. Ns2simulator is widely used for network simulation since itsimulates 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 of5nJ/bit/message to fuse 2000-bit messages while varyingthe percentage of total nodes that are cluster heads. Figure6 shows a 100 node network with nodes places atrandomly generated points. Figures show the clusterdistributions at different states of the network during the

protocol execution with dynamic cluster distribution. Thesystem can determine a priori, the optimal number ofclusters to have in the system. This will depend on several

parameters, such as the network topology and the relativecosts of computation versus communication. Figure shows

how the energy dissipation in the system varies as the percent of nodes that are cluster-heads is changed, Notethat 0 cluster-heads and 100% cluster heads is the same asdirect communication. From this plot, we find that thereexists an optimal percent of nodes N that should be

cluster-heads. If there are fewer than N cluster heads, somenodes in the network have to transmit their data very far toreach the cluster-head, causing the global energy ill thesystem to be large. If there are more than cluster heads, thedistance nodes have to transmit to reach the nearest clusterhead does not reduce substantially, yet there are morecluster-heads that have to transmit data the long-hauldistances to the base station and there is less compression

being performed locally. For our system parameters andtopology, N ==5%.

Figure: Normalized power dissipation Vs. % cluster heads


7/8


Figure . Energy Dissipation as the network diameter increases

It is also seen from the results that the time at whichthe first nodes dies in proposed protocol is much morethan the time for direct communication. And also due torandomized rotation of the cluster head the nodes will die

randomly. Hence there will be no large areas in thenetwork which are not sensed by the sensors. In addition toreducing energy dissipation, proposed protocolsuccessfully distributes energy-usage among the nodes inthe network such that the nodes die randomly and atessentially the same rate.

H. Conclusions:which uses dynamic clustering in order to distribute

load at different points of time and minimizes the overallenergy dissipation in the system. At different times, eachnode has the burden of acquiring data from the nodes inthe cluster, fusing the data to obtain an aggregate signal,and transmitting this aggregate signal to the base station.Our protocol is completely distributed, requiring nocontrol information from the base station, and the nodes donot require knowledge of the global network in order forthe We had proposed a new cluster based new protocolwhich extends LEACH to networks of larger diameter byusing MTE routing for communication of cluster heads to

base station. Our protocol is distributed protocol protocolto operate.Based on our simulations with networksimulator ns it is shown that our protocol has less totalenergy dissipation in the system as the network diameterincreases.

I. .References[1] W. Heinzelman, A. Chandrakasan and H.

Balakrishnan, "Energy-Efficient Communication Protocolfor Wireless Microsensor Networks," Proceedings of the33rd Hawaii International Conference on System Sciences(HICSS '00), January 2000.

[2] W. Heinzelman, J. Kulik, and H. Balakrishnan,"Adaptive Protocols for Information Dissemination inWireless Sensor Networks," Proc. 5th ACM/IEEEMobicom Conference (MobiCom '99), Seattle, W A,August, 1999. pp. 174-85.

[3] A.A. Abbasi, M.Younis, "A Survey on clusteringalgorithms for wireless sensor networks", ComputerCommunications (2007),doi:10.1016/j.comcom.2007.05.024

[4] Chandrakasan, Amirtharajah, Cho, Goodman,Konduri, Kulik, Rabiner, and Wang. DesignConsiderations for Distributed Microsensor Systems. InIEEE 1999 Custom Integrated Circuits Conference(CICC), pages 279-286, May 1999.

[5] I.F. Akyildiz et aI., Wireless sensor networks: asurvey, Computer Networks 38 (2002) 393-422. .

[6] K. Akkaya, M. Younis, A survey on routingprotocols for wireless sensor networks, Elsevier Journal ofAd 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 Hocnetworks, in: Proceedings of IEEE INFOCOM, March2000.


8/8


[8] A Clustering Scheme for hierarchical Control inMulti-hop Wireless Networks, by S.Banerjee, S.Khuller.

[9] S. Basagni, Distributed clustering algorithm for ad-hoc networks, in:Proceedings of the InternationalSymposium 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 sensornetworks", Proceedings of the 10th IEEE Int.l Symp. OnModeling, Analysis, & Simulation of Computer &Telecommunications Systems (MASCOTS.02), IEEE2002.

[11]NS 2,Network Simulator World WideWeb,http://www.isi.edu/nsnam/ns/ns-build.html. 2004.

[12)MITuAMPS LEACH ns Extensions.'World WideWeb,http://www.ece.rochester.edu/research/wong/code/index.htm , 2005.

[13J Performance study of IEEE 802.15.4 usingmeasurements and simulations by Marina Petrova, JanneRiihijarvi, Petri Mahonen, and Saverio Labella.

[14] J. Zheng and Myung J. Lee, "A comprehensive performance study of IEEE 802.15.4," Sensor NetworkOperations, IEEE Press, Wiley Interscience, Chapter 4,

page. 218-237,2006.[15] Maika Halgamuge, Siddeswara Mayura Guru, and

Andrew Jennings ;Energy Efficient Cluster Formation inWireless Sensor Networks, In Proceedings of IEEEInternational Conference on Telecommunications, IEEEICT 2003, IEEE Press.

[16] Yuon Guo and Janise Mcnair; Cost EfficientCluster Formation for Wireless Sensor Networks, InProceedings 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.VLSIDesign,pp 161-167,Jan 2002.

[18] S. Tilak et ai., "A Taxonomy of WirelessMicrosensor Network Models," in ACM MobileComputing and Communications Review (MC2R), June2002.

[19]Alan Mainwaring,Joseph Polastre,Robertazewczyle,David Culler and John Anderson,WirelessSensor networks for habitat monitoring ACMInternational Workshop on Wireless Sensor Networks andapplications(WSNA 02),Atlanta,GA,September 2002.

Documents

Dynamic Cluster Distribution Routing Protocol For Wireless Sensor Network