MOBILITY AWARE ROUTING WITH PARTIAL ROUTE PRESERVATION IN WIRELESS SENSOR NETWORKS

Sanat Sarangi, Subrat Kar Bharti School of Telecommunication Technology

And Management, IIT Delhi New Delhi 110016 India

sanat.sarangi@gmail.com, subrat@ee.iitd.ac.in

ABSTRACT

We propose a novel reactive routing algorithm called PARTROUTE which achieves energy efficient routing in sensor networks with stationary and mobile nodes. PARTROUTE uses coarse mobility awareness in each node to reduce the overheads of reactive routing by intelligently re-using parts of the created on-demand routes beyond their standard lifetime. We show that the responsiveness of the network improves while the overall network traffic is reduced. The effectiveness of PARTROUTE with a large percentage of mobile nodes is also shown.

Keywords: wireless sensor network, routing protocol, PARTROUTE, mobility aware, AODV, AODVjr

1 INTRODUCTION A typical sensor network has a single gateway and a set of connected nodes that participate in sensing and forwarding application defined events to the gateway. Some of the key driving factors in designing routing algorithms for sensor networks are (a) size of the network (the number of nodes), (b) limited node energy, (c) deployment topology and (d) provision for node mobility. Traditionally, there have been two approaches to routing– proactive and reactive. In proactive routing, routes can be computed and updated beforehand so that data is sent through the best possible route. In reactive routing, routes are created on-demand. The diversity of sensor network applications have driven the evolution of classes of application appropriate routing algorithms which can be cluster-based [1], hierarchical [2], robust [3], energy-aware [4], geographic [5], query based [6] or swarm-behaviour-based [7]. When some nodes in the network are mobile, reactive routing becomes necessary. Dynamic Source Routing (DSR) [8] and Ad-hoc On-demand Distance Vector Routing (AODV) [9] are popular reactive algorithms developed for mobile ad-hoc networks (MANETs). 2 MOTIVATION Most reactive algorithms assume that the nodes in the network are mobile. However, mobile nodes are not explicitly aware of their own mobility.

Recently, in [10], PH-MA-AODV and Agg-AODV have been proposed that use mobility awareness to improve the performance of reactive algorithms with high-speed MANETs. In PH-MA-AODV a highly mobile node discards a route-request to prevent itself from participating in route formation. In Agg-AODV the route-request accumulates the degree of mobility of each intermediate node and the destination chooses the route with minimum mobility. However, both the algorithms assume that the intermediate nodes can precisely measure their speed of movement. In [11], prediction of broken links is used to trigger routing updates before links break.

Mobility requirements in most sensor networks are different from those of MANETs. The emphasis in sensor networks is on minimizing energy consumption with provision for (often low) mobility within a stationary mesh of nodes where all nodes talk to a central gateway. We propose a routing algorithm PARTROUTE for memory-constrained and energy-sensitive sensor networks with stationary and mobile nodes where each node is explicitly aware of its mobility status at any point of time and this knowledge is used to intelligently preserve part(s) of the route(s) formed during reactive routing beyond the standard route lifetime. PARTROUTE dynamically adapts itself to changing network conditions and helps improve event delivery while reducing both (a) the overall network traffic and (b) latency of route formation (which is critical) for mobile nodes.

With rapid strides in Micro Electro-Mechanical Systems (MEMS), coarse mobility (moving or stationary) awareness can now be easily added to

UbiCC Journal, Volume 6: Issue 2 848

Ubiquitous Computing and Communication Journal (ISSN 1992-8424)

sensor nodes with the help of low-cost accelerometers. Accelerometers have been used to detect gait postures like walking, standing, lying [12] [13]. Such information in the context of the behavioural pattern of the subject can be used to know whether a node is (and to predict if is likely to remain) stationary or mobile. In a sensor network containing such semi-mobile nodes, any semi-mobile node that finds itself stationary could temporarily behave like any other (always) stationary node. PARTROUTE is designed to effectively use this behavior to significantly improve routing performance in such networks. The rest of the paper is divided into four sections. Section III describes the algorithm. In Section IV we evaluate the performance of PARTROUTE analytically and compare it with the simulation results given in Section V. PARTROUTE is also compared with AODVjr [14] to show the improved performance under different conditions.

3 THE PARTROUTE ROUTING

ALGORITHM In PARTROUTE, we consider a sensor network with N nodes v1..vN having a set of stationary nodes VS and a set of mobile nodes VM. |VS| + |VM| = N and VS VM = N. Any node vi belongs to only one of the sets and adheres to the policies laid out for that set. L(vi, vj) is a link between vi and vj, i j. In PARTROUTE we have two kinds of links– static and dynamic. If two nodes vi, vj VS, they are permitted to form a static or a dynamic link. In all other cases the link is dynamic. Links are created and updated only on reception of packets and a table is used to maintain link information. A route between vi and vj with intermediate node vk is denoted by P(vi, vk, vj), i j k. A dynamic link has a lifetime of lifetimeDYNAMIC and for a static link it is lifetimeSTATIC with lifetimeDYNAMIC < lifetimeSTATIC. The value for lifetimeSTATIC is application specific and is further discussed in Sections 4 and 5. It depends on factors like deployment area, number of nodes, mobility behaviour of nodes and their event generation rates.

AODV is an established reactive routing algorithm for MANETs and AODVjr is a successor to AODV which achieves performance comparable to AODV without overheads such as sequence numbers, gratuitous RREP, hop count, hello messages, RERR and precursor lists from AODV. AODVjr is therefore more suitable for memory and energy constrained sensor networks. We compare PARTROUTE with AODVjr.

PARTROUTE uses two kinds of route-requests: M-ROUTE-REQUEST and S-ROUTE-REQUEST for route creation as discussed in Section 3.4 and Section 3.5 respectively. M-ROUTE-REQUEST is processed by vi, vj  VS VM whereas S-ROUTE-REQUEST is processed by vi if vj   VS and

discarded if vj  VM. A mobile node uses only M-ROUTE-REQUEST to create a route to the gateway. All stationary nodes in the network except the gateway use S-ROUTE-REQUEST to reach the gateway. The gateway uses M-ROUTE-REQUEST to find a stationary or mobile node in the network since M-ROUTE-REQUEST is accepted and processed by all nodes. We assume that the network has a single gateway and each node in the network is aware of this gateway. The principle can be extended to multiple gateways, without loss of generality. In PARTROUTE stationary nodes are allowed to behave like mobile nodes under certain conditions. If the duration for which mobile nodes rest (i.e. become stationary) is large when compared to the duration for which they move, they can be allowed to temporarily function as stationary nodes during the stationary phase. The target application determines (a) the use of this role-switching feature and (b) the duration of rest. Role-switching is discussed in Section 3.3. 3.1 Reactive Route Discovery We use Expanding Ring Search based route discovery [15], an energy efficient method to discover a route to a destination node. The source sends a route-request message with TTL set to 1 and simultaneously starts a timer that expires after twice the node-traversal time. If the destination is one hop away it sends a route-reply message which reaches the source before the timer expires. If a route-reply is not received, the source increases the TTL value, proportionately increases the timeout and repeats the process till either the destination is reached or the source gives up. This limits the propagation extent of the flooded route-request thereby saving energy. The destination sends the route-reply back to the source along the route taken by the first route-request it receives. When a node with a valid route to the destination sends a route-reply on behalf of the destination, the reply is called gratuitous [15]. 3.2 Partial Route Preservation Partial route preservation implies retaining a part of a reactively created route, for a period longer than the standard lifetime for the route. The partial route is called a trace. Each node on a trace is called a representative. A stationary or mobile node which is not a representative is called a non-representative. The gateway is considered to be a representative of itself. In PARTROUTE there can be two kinds of route-replies to a route-request: (a) intermediate-node route-reply that can only be generated by a representative, (b) destination-node route-reply that only the gateway can generate. Henceforth, a node that is allowed to send a route-reply for a route-request is called a reply-node. It may be noted that an intermediate-node route-reply is different from a gratuitous route-reply [15] which is generated by any

UbiCC Journal, Volume 6: Issue 2 849

node witsequencethe nodeSequencePARTROgratuitouany comintermedi

Figure 1:

Fig. 1of stationmobile nwhich thethe route-till it reabecomes candidatecreate-tra

Statioroute afterepresentthe routestationaryabout it. gateway representthan thestationaryrequests e Hencof represpectivnon-represet of ponodes in t 3.3 Cr A rocalled rep

th a route t number info and that rec

e numbers OUTE nor AOs route-reply,

mmunication iate-node rout

Trace formatio

1 illustrates trnary (black) annode 6 sendse gateway rep-reply (RREPaches a moba representa

es are conveace messages onary nodes (ner a mobile ntatives. The me-reply with ty nodes that pAny subsequby a mobile

tatives which e gateway cry nodes. Thieven faster. ceforth, we uspresentatives ely. A represesentative by ositive integethe network).

reate-trace Moute-reply crepresentative c

to the destinormation alreaceived with t

are usedODVjr. Morea representatto the gate

te-reply that it

on in PARTROU

race formationnd mobile (whs a route-reqplies. Each staP) encounters bile node (notive candidat

erted to reprdiscussed in S

node 5 in Fig. node (node 4mobile node (this informatiprocess the rouent request f

node can beare closer to reating moreis helps servi

se SR and SU and no

sentative is deUi, i   I+, whe

ers. SR  SU =

Messages eates a set ofandidates whi

nation based ady present wthe route-requd by neieover, unlike ive does not seway about t generates.

UTE

n in the presehite) nodes whquest (RREQ)ationary node on its return p

ode 4 in Figte. Representaresentatives wSection 3.3. 1) that occur

4) cannot beco(node 4) updion to notify oute-reply aftefor a route toe serviced by

the event soue traces on ice future ro

to denote theon-representatenoted by Riere I+ denotes= N (number

f potential noich could beco

on with uest. ither

the send

the

ence here ) to that path . 1)

ative with

in a ome

dates the

er it the the

urce the

oute-

e set tives and

s the r of

odes ome

reprepnodgatbeccanthe getcantracthe crerouthe is ntracack

contracupdcreretrackAckto intetracbecTrareprepenethisthatit dwit0ovecanintegat 3.4

REROmoIf anodgathavcrestatswinod

presentative nopresentative cade 3 in Fig. eway and rec

come a reprndidate does n

path of the ros the route-re

ndidates sendsce-request (C

representativate-trace. Wit

ute request orilast represent

not used here.ce acknowleknowledgemen

A create-tracnvert all dynamce originator dating their late-trace origries to send cknowledgemenknowledgeme(a) lossy lin

ermediate statce (or its ackcomes mobile ansmission opresentative fply that it genergy consumps behaviour bt every time a

does not send thin the next   CTPERIOD

erheads due ton also becomermediate repeway about th

Route FoStationar

Stationary EQUESTs to OUTE-REQUE

de operation. an S-ROUTE-de, it is simplyeway with S-R

ve only statioated in the prtionary node fitching (Sectide (Section 3.5

odes (Section andidates form1) sends a crceives an acknresentative. Snot know whetoute-reply, theply after a ss a special mTR) to the preve candidatesth no intermediginator sendstative candida. The gatewaydges its recnt to the creatce message anmic links on thand the gatewink lifetimes

ginator makescreate-trace if nt beforents may not nks or (b) rotionary node knowledgemeand voluntari

of a create-for every intnerates can sigption level of by defined a va representativa create-trace(lifetimeSTATI

lifetimeSo create-trace.me carriers

presentative caheir presence.

ormation Anry Nodes

nodes onlcreate route

ESTs only suSo, gateway

-REQUEST iy discarded. SROUTE-REQ

onary nodes irocess is the fails to form aon 3.6) and 5).

3.2). The lasmed by a routereate-trace (Cnowledgemen

Since a reprther it is the lae first mobileseries of repr

message calledevious node (s) asking it tdiate mobile ns the create-traate. Create-tray on receivingceipt by sene-trace origin

nd its acknowlhe path betwe

way into staticto lifetimeST

s a suitable nf it does not rre giving

be received ele-switching on the path

ent) message ily drops the mtrace messagtermediate-nognificantly inthe network.

variable CTPEve sends a cre

e for any evenIC - CTPERIOD)TATIC to re. Create-trace of the nod

andidates to

nd Route R

ly use Ses to the gatupport destina

is the only reis received bySo a route creaQUEST is guaimplying that same as the r

a route, it perfbehaves like

st of these e-reply (i.e. CT) to the nt (CA) to resentative ast one on node that

resentative d a create-(the last of to send a nodes, the ace if it is

ace request g a create-nding an ator. ledgement een create-c links by TATIC. The number of receive an g up. either due where an of create-suddenly

message. ge by a

ode route-crease the We limit

ERIOD such eate-trace,

nt received ) seconds, duce the messages

de ids of notify the

epair for

S-ROUTE-teway. S-ation-node eply-node. y a mobile ated to the aranteed to

the trace route. If a forms role

a mobile

UbiCC Journal, Volume 6: Issue 2 850

3.5 RoM

Mobiform rouindicate emode of The interdestinatiocircumsta

Figure 2: extends tra

In representROUTE-successfuand a repterminatinlinks berepresentEven dumessage gateway traces geprinciple.from nodROUTE-2, 6, 10) to extend

After mode, if receive aan applicROUTE-a certainRETRY-as determgateway created bpossibly applicationodes swROUTE-

Sinceall nodes

oute Formatobile Nodes ile nodes usutes to the geither intermef operation inrmediate-nodeon-node modances as discu

M-ROUTE-REace L(1, 2) to P

the intermtative can be REPLY to a

ully created ropresentative cong at the repreyond it or

tative is the gauring trace

acknowledginstead of tht extended by. In Fig. 2 an de (representaREQUEST fr to the gatew

d the trace L(1creating a rthe mobile n

an acknowledcation level REQUESTs i

n number ofCOUNT) usinmined by this the reply-n

between the mcreating anoth

on level commwitches back to

REQUESTs fe M-ROUTE-s they may

tion and Ro

se M-ROUTEgateway. A mediate-node orn the M-ROUe mode is usede is used

ussed below.

EQUEST from mP(1,2,6)

mediate-node a reply-node an M-ROUTEoute between ould extend tesentative by create a ne

ateway itself aextension,

ement is gehe intermediaty the recursivM-ROUTE-R

ative) 2 in resrom node 10 f

way and adds s, 2) to P(1, 2, oute in the inode discover

dgement from event, it sta

in destinationf retries (givng the intermehe target apnode for this mobile node her trace in th

munication reso using intermfor creating suREQUESTs form shorter

oute Repair

E-REQUESTsmobile node r destination-nUTE-REQUE

ed by default under spe

mobile node 10

mode, and send theE-REQUESTthe mobile n

the previous tradding new stew trace if as shown in Fithe create-tr

enerated by te node. Exis

vely applying REPLY genersponse to theforms a routestatic link L(26).

intermediate-nrs that it did

the gatewayarts sending -node mode a

ven by EVENediate-node mpplication. Smode, a routand the gatewhe process. Osumes, the momediate-modeubsequent routare processedr traces than

for

s to can

node EST.

and ecial

0

any e M-T. A node race tatic the

ig. 1. race the

sting this ated M-P(1,

2, 6)

node not

y for M-

after NT-

mode ince te is way

Once obile e M-tes. d by n S-

ROnodHowpronod

3.6

the tranbehstatdepopeneievea midleconmo

by behFoucircwhcomhowWhits REnodRORE

Fi

repRQ,prochaformstat

respmoRQ,roupac

1appbyU2, betw

OUTE-REQUEdes since theywever, repres

ocess would hdes generating Role SwitA stationarygateway th

nsmitting a Shave like a motionary nodeployment or eration possighbouring sta

ents through Vmobile node ce and the nversion afterbile node as dWe now expa node partici

haviour of PAur cases arecumstances een it creates

mbination of w PARTROherever applicrole immediat

EQUEST. Rolde from its

OUTE-REPLYEQUEST.

igure 3: Refere

Case 1: Lpresentative U

, G). If Uk swocesses M-ROance to becommed if K = Ptionary. Case 2: If

ponse to thebile then {M, G}   SR.

ute-replies to ckets since it i

Case 3: If o switches its

parent since MR1 which com

…, UP, Ri} ween represen

ESTs. This isy would anywasentatives on thelp provide fag M-ROUTE-R

tching y node that is uhrough other S-ROUTE-REobile node (Sees that hav

have becoibly due toationary node

VS VM insteaould become

target applr consideringdiscussed in Splain using Figipating in rou

ARTROUTE ae used to encountered bs a route tothese cases m

OUTE handlcable, the contely after procle-switching responsibility

Y it receives

ence diagram fo

et us assumUk lies on P(Mwitches its rolOUTE-REQU

me a represent or all nodes

R1 that sent e M-ROUTE

M, U1, U2, …, UR1 cannot ssubsequent

s not a represeone of the oth role, its effeM-ROUTE-R

mes before Ri.   SU. If Ri

ntatives Ri-1 a

s acceptable ay change thethe trace creaaster responseREQUESTs.

unable to find stationary n

EQUEST is aection 3.5). Th

ve been isoome isolatedo non-availaes to be ablead of only VS.stationary if

lication justig the dynamiection 2. g. 3 how role-

ute formation aafter the route analyze the by a mobile o the gatewmay be used tles other ncerned nodecessing the Mdoes not ex

y to processfor this M

or role-switching

me a stationM, U1, U2, …, UP

le immediateUEST, it fortative after thbetween Uk a

the intermedE-REQUEST

UP, R1}  SU ansend intermedM-ROUTE-Rentative any m

her representafect is not imREQUESTs ar

However, no, now a mo

and Ri+1 gener

to mobile ir location.

ated in the es to other

a route to nodes by

allowed to his allows

olated by d during ability of e to route . Similarly, it remains ifies this cs of the

-switching affects the is created. different node M

ay G. A to explain situations.

e switches M-ROUTE-

xempt the s the M-

M-ROUTE-

g analysis

nary non-P, R1, R2, …, ly after it regoes its he route is and R1 are

diate-node becomes

nd {R2, …, diate-node

REQUEST more. atives Ri, i mmediately

re fielded w {M, U1, bile node rates a M-

UbiCC Journal, Volume 6: Issue 2 851

ROUTE-node respgateway between nodes thintermedifor eventthis as a node MREQUESbreaking new routein the cylink lifcommuni

Therecould advSo we comobile condition

Case becomes ROUTE-representto R1) or Else, UK 4 PER

PAR A large dreactive athe earliesuccessfuIn this Seto characrespect toused to aSection 5 4.1 AsThe nodtransmisscarried ouby a mobCK with rposition route-reqnegligibleconditionfor everynegligibleat the me(denoted any nodtransmitteand procesince they

REQUEST, Rponse withoutpasses throuRi and Ri-1.

hat use routiate link fail ts they sends

broken link M-ROUTE-RESTs) to find

the above cyes do not use t

ycle are not usfetimes expication througefore, rapid roversely affect onstrain fidgetto minimize

ns. 4: If a mobilestationary j

REQUEST tative provideall nodes betwremains a stat

RFORMANCERTROUTE

delay in routealgorithms dueer sections, wully help reducection we builcterize PARTo delay in roanalyze the s

5.

ssumptions des are idension range out with respecbile node M mradius K as sof M in the

quest and gee. All transm

ns are ideal soy route-requese when compessage sourceby τ, τ 0) fo

de within a er is essentiaessing delays y are applicab

Ri-1 could givt realizing tha

ugh Ri, thus When mobiles with L to receive acto the gatewaproblem and

EQUESTs new routes

ycle in the prthe nodes in thsed, the cycleire due t

gh the links. ole-switching bperformance

ty mobile node the overh

e node UK swiust after pro

it either d K = P (sincween UK and tionary non-re

E EVALU

e formation ise to their on-d

we have seence this delay fld an analyticTROUTE’s poute formatioimulation res

ntical with aof radius L. ct events sent

moving withinshown in Fig.e interval betetting back

mission, channo a route-respst. Radio prop

pared to the tre. So, the Hopfor a message

radius L oally the same.are considered

ble to every no

ve a intermediat its route tocreating a cy

le (or station(Ri-1, Ri) as cknowledgemay, they perc

d use destinat(or S-ROUto the gatew

rocess unlesshe cycle. If noe disappears ao absence

by a mobile nof PARTROU

des to always heads due s

itches its role ocessing the

becomes ce UP is adjaR1 are station

epresentative.

UATION

s a bottleneckdemand naturen how traces for mobile noal model in o

performance won. The modesults presented

an ideal circThe analysisto the gatewa

n a circular reg4. The changtween sendinits response

nel and recepponse is receipagation delaransmission dp Traversal Tto be receivedof the mess. Mean queued to be a part ode. We assum

iate-o the ycle

nary) an

ments eive tion-

UTE-way the

odes after

of

node UTE. stay such

and M-

a cent

nary.

OF

k for e. In can

odes. rder with el is d in

cular s is ay G gion

ge in ng a e is ption ived

ay is elay

Time d by sage eing of τ

me a

densucgatnod

Figana

4.2

is arouexpM awhwhdelat dD .Resanycumx

RT

reqnodnodprothe leascaswouof t

by rep

nse uniform dch that an eveeway in ⎡x/L⎤des on a linear

ure 4: A circulalysis

EstimatinTime

Suppose at aat a distance

ute to the gatewpects a route-rat a distance xich it originatich it receiveay experiencedistance x and2πxdx. Hence

sponse Time ywhere in mulative delay K in CK. Thi

TA  D .K

K

With the assquest from M des within a cdes again broaocess. In AOD

route requestst x/L   hops

se situation fould have to fitraces. For thiFor PARTROan intermedi

presentative co

deployment oent transmitte⎤ hops throughr path between

lar sensor netwo

ng Route F

a given instanx from the Gway. It generaresponse. Delax is the duratites the route-rs the route-re

ed by M for ald (infinitesime, for a given (RTA) experieCK is obtain

y over all posiis is given as

sumptions in is received a

circle of radiuadcast the rou

DVjr only G ist. So, the route

to reach G. or PARTROUield all route-s case Dx   2τOUTE, the roate node if itould be encou

of sensor noded by M can h (⎡x/L⎤−1) intn M and G.

ork deployment

Formation

nt T, the mobilG and does nates a route-reay (D ) experion between trequest and th

eply. So the cll its positions

mal) width dx algorithm A,

enced by M pned by averaitions at distan

Section 4.1, at the same tius L around

ute-request to s allowed to re request wouThis is also

UTE since therequests in thτ x/L . ute-reply mayt is a represenuntered at n ho

des in CK reach the

termediate

t for

Response

le node M not have a equest and rienced by the time at he time at

cumulative s on a ring from G is the mean positioned aging the nce x, 0 

1  

the route ime by all M. These repeat the

respond to uld need at

the worst e gateway he absence

y be given ntative. A ops where

UbiCC Journal, Volume 6: Issue 2 852

1 n xlifetimes formationattempts Assumingequal proDx    2τ

In thethe first h

Lowepossibilitchoked wperformaResponsespeed mo5.2.2). W(TI) whicPARTROthe valuPARTRO

TI   RTPRT

4.3 Ef The pthe numbtraces arpreservedfaster resthereby cpackets. Igateway, lifetime refreshedlifetimeST

Deploarea and used to eorder to h

5 SIMU Discrete 1000 secoPARTROon PARTfor PARFinally, Ta measurPARTRO 5.1 Co An inodes. Talways atransmitsgateway.

x/L . Mobilityare config

n depends and percen

g n takes eacobability, the ∑ /L n /

e best case, ahop. So Dx   2er the Respty of the gatewith route-requance in a livee Time improbile nodes

We also definech is used to

OUTE when cue of TI, bOUTE.

PARTROUTETAODV

      

ffect of Multipperformance

ber of event sore created ad for longer dusponses to roucontrolling thIf a node in t

for this traof the netwo

d with eventTATIC. oyment paramthe mean ratestimate a suit

have effective

ULATION

event simulaonds is used t

OUTE. The efTROUTE is aTROUTE are

Trace Index dire of the RespOUTE.

onditions ideal circular

There are no awake. For , it receives aNon-receipt

y pattern of Mguration specon earlier ntage of stch value withmean value ox/L     τ x/

all route-reque2τ. ponse Time, way and noduest packets the scenario. Aroves perform(further discu

e a figure of mcompare the

compared to Abetter the re

   

ple Event Souof PARTROUources increaand (b) exisurations. Mor

ute-requests frhe flooding othe network hace to persisork it is impts at interva

meters especie of event gentable value for traces.

ation with simto evaluate thffect of multipanalyzed. Thee compared aiscussed in Seponse Time o

radio modelpacket losseevery event

an acknowledof acknowled

M is random, trcific and trroute formatationary no

hin its range wof Dx is given/L 1 . ests are fielde

lesser is es near it gethat could degr

Also, decreasemance for hussed in Secmerit Trace Ine effectivenesAODVjr. Smaesponsiveness

                        

urces UTE improvese since (a) msting traces e traces help g

rom mobile nof routing conhas a trace tost for the enportant that ials smaller t

ially size of neration shouldr lifetimeSTATI

mulation runshe performancple event soue results obtaiagainst AODection 4 is usef the network

l is used fores and nodes t that the ndgement fromdgement lead

race race

ation odes. with n by

ed at

the tting rade e in high ction ndex s of aller of

2  

es as more

are give odes ntrol o the ntire it is than

the d be IC in

for ce of urces ined

DVjr. ed as k for

r all are

node m the ds to

retrevedepbe mochaMoNobetwlocandstatstatnodthe

Figdep

QK(Figeveeacgengateacwe incrdisthomnetwsho

hol(cenalsoPAthe the

consecdep

ransmission oent. A single ployed non-evstatic or mobre event-gen

aracterize theovement of mdes randomlyween 1.0m/sation with th

d velocity aretionary nodetionary node de (discussed duration of si

ure 5: A quarteployed nodes an

Nodes are d(a quarter of

g. 5). QK is dent-generatingch node (L) inerated by a eway needs 3

ch other by 75use 10 node

rease the dtribution of mogeneous evwork of reas

own that Trac

lds for each ontered at G wo serves a

ARTROUTE’s gateway is anetwork. Each non

nfigured to bector. Event-geployment area

of the same evgateway, a s

vent- generatinbile as per reerating mobie performancobile nodes isy choose a los to 2.0m/s. he chosen veloe chosen. It

e may be eor (b) a role-in Section 2) imulation.

er-circular regiond a gateway

eployed in a CK in Sectiondivided into 3

g nodes in eacs 75m. Fromnode farthest

3 intermediate5m to reach tes in each sedensity of nnodes acrossven with mobsonable size fe Index for C

of its four comwith radius K)as a refer

performanceat a corner ra

n-event-generae mobile movnerating node

a. The range o

vent instead oset (R) of 30 ng nodes (conequirement) anile nodes arece of PARTs random wayocation and aAfter movin

ocity the nexmay be not

either (a) an-switching semwhich is stat

on with random

quarter-circun 4.1) with rad3 sectors withch sector. The

m Section 4.1,t (i.e. 300m) e nodes separthe gateway.

ector to (a) sunodes, (b) s the deploymbility and (c)for analysis.

CK (in Section

mponent quar) and hence forence for e in topologiather than the

ating nodesves only withie(s) move in of each node

of the next randomly

nfigured to nd one or e used to TROUTE. ypoint [8]. a velocity ng to the xt location ted that a n always mi-mobile tionary for

mly

ular region dius 300m h 10 non-e range of , an event

from the rated from However, ufficiently keep the ment area ) create a It can be

n 4.2) also

rter circles for QK. QK

analyzing ies where centre of

s when in its own the whole is kept at

UbiCC Journal, Volume 6: Issue 2 853

75m to hrange oflifetimeDYand EVEestimatedevent trgeneratinnode in Pthe retrieuses d(Section HenceforPARTRO We uthe total ntransmitteto denoteby all noevents sean acknowtransmittetransferre

TPE   T

5.2 Re

5.2.1 E Fromreduce thdiscussioof event speriodicalifetimeSTperformasignificanby increa

Figure 6: lifetimeSTA200 secon

5.2.2 C

Respmobile ev150s as used for

have sufficientf nodes. PaYNAMIC is keptENT-RETRYd Hop Traveransmission i

ng mobile nodPARTROUTEes defined bydestination-no3.5) till it su

rth we use OUTE with theuse the term number of (daed by all nodee the total numodes. Event Cent by an evenwledgement. ed for everyed to the gatew

 P  CE  C

esults Effect of multim Fig. 6 it is clhe Response Tn in Section sources once t

ally, any furtTATIC does

ance e.g. fornt improvemeasing lifetimeS

Variation of ReATIC (lifetimeSTds)

Comparison of

ponse Time fovent source doshown in Figr comparison

t overlap betwacket size ist at 15s, CTPE

Y-COUNT is rsal Time is is attempted

de every 6 secE fails to delivy EVENT-REode M-ROuccessfully dPARTROUTe value of lifeTotal Packet

ata and routinges. Event Pacmber event paCount refers tnt source for So, the total ny event (TP

way is given b

    

iple event soulear that multiTime of the ne4.3. Also, forthe created trather increase

not signifir a single ent in response

STATIC from 150

esponse Time (TATIC takes valu

f PARTROUT

or PARTROUoes not vary s

g. 6 So, PARn with AOD

ween transmiss kept constERIOD is set to

set to 3.0.1 seconds. by an ev

conds. If a mover an event aTRY-COUNT

OUTE-REQUEdelivers an evE-x to referetimeSTATIC asCount to den

g control) packet Count is u

ackets transmito the numbewhich it rece

number of pacPE) successfby

      

urces iple event souetwork as perr a given numaces get refres

in the valueicantly imprevent source e time is obser0 to 200.

(in seconds) wites 50, 100, 150

TE with AODV

UTE for a sinsignificantly a

RTROUTE-15DVjr. A cer

sion tant, 30s The An

vent-obile after T, it EST vent. r to s x. note

ckets used itted

er of eives ckets fully

3  

urces r the mber shed e of rove

no rved

th 0,

Vjr

ngle after 0 is rtain

permocomFigTotPA

nodthanis Resevewhtwo

FigAOmob

are the insttypfor (FighigSecmoPAdelto i

Fig

rcentage of thbile and the p

mpared by vags 7, 8 and 9 stal Packet

ARTROUTE-1It is observe

des, Responsen half of thatalmost twicesponse Timeen when up toen almost all o algorithm

ure 7: VariatioODVjr and PAR

bile nodes (0%

For 0% mosent over (thstationary

tantaneously ically shorterPARTROUT

g 8) are duegher Event Pacction 4.2, wheves at a (rel

ARTROUTE-1ivering 3% mits significantl

ure 8: TPE for

he stationary nperformance oarying this pershow variation

Count and50 and AODVed from Fig.

e Time for PAt of AODVjr e as responsremains signi40% nodes arnodes (80%

ms have s

on of Response RTROUTE-150

: all nodes stati

bility, eventshe long) tracenodes wherecreated route

r. So, marginTE-150 when e to PARTROcket Count. Hen the event-glatively highe50 outperf

more events wily lower Resp

r AODVjr and P

nodes from R of both the algrcentage fromn of the Respod Event CVjr for 0-80%. 7 that for

ARTROUTE-1i.e. PARTRO

sive as AODificantly smalre mobile. Asnodes) are m

similar per

Time (in seconfor different nuonary)

s in PARTROes created a peas in AODes to the gatally higher Tcompared to

OUTE-150’s However, as digenerating moer) speed of forms AODith 21% loweronse Time.

PARTROUTE-

are made gorithms is m 0 to 80. onse Time,

Count for % mobility.

stationary 150 is less OUTE-150 DVjr. The ller (60%) expected,

mobile, the rformance.

nds) for umbers of

OUTE-150 priori over DVjr, the teway are

TPE levels o AODVjr

relatively scussed in obile node f 4-5 m/s, DVjr by r TPE due

150

UbiCC Journal, Volume 6: Issue 2 854

With

decreasesPARTROimprovemlack of s150 and Count forfor all caalmost samore eve

To sewith a larthe simulswitchingThe duragiven bymean vala standarswitchingis initiallmore evelower TP

Figure 9: 150

A todeploymebehavioucommonl10 wherenodes anthrough wremainingrandom-wThere iRemaininTransmisbetween PARTROcomparedand 20% node tranin carryin

mobility, lens. For 40OUTE-150 iment of 26%sufficient statAODVjr hav

r PARTROUases except wame. PARTROents than AODee the effectsrge stationarylation we cong its status beation for beiny two normallues of 450s ard deviation g from happenly mobile. PAents, has a 17%PE compared t

Event Count fo

opology in ent has been u

ur of PARTRly used confie 50% of the nd the gatewwhich events g 50% move waypoint mobs one even

ng conditionsssion range adjacent node

OUTE-150 ded to AODVjr lower TPE. W

nsmission rangng out localiza

ngths of traces0% mobiliis 74% of . With 80% tionary nodesve similar TPTE-150 is mowith 0% mobOUTE-150 de

DVjr with 40%s of semi-moby period withinfigure each netween mobilng mobile anlly distribute

and 50s respecof 10s. Thi

ning synchronARTROUTE-% lower respoo AODVjr.

or AODVjr and

Fig. 5 withused to characROUTE. Howguration woustationary no

way) form acan be easilthroughout th

bility model dnt-generating s are the sof nodes an

es on a row olivers 12% mat a 20% low

With approprige, the configuation [16] [17]

s shorten so Tity, TPE f AODVjr–

mobility, dues PARTROUPE levels. Evore than AODbility where ielivers up to 1

% mobility. bility (Sectionin the durationnode in R to kle and stationnd stationary d variables wctively, each wis prevents rnously. Each n-150 delivers onse time and

d PARTROUTE

h random ncterize the genwever, a typuld look like odes in R (i.e connected y routed and he grid usingdiscussed ear

mobile nosame as earnd the distar column is 7

more events wwer response tiate adjustmenuration also h].

TPE for an

e to UTE-

vent DVjr it is 15%

n 2) n of keep nary.

are with with role-node

5% d 8%

E-

node neral pical Fig. . 15 grid the

g the rlier. ode. rlier. ance 75m. when time nt of helps

Fig

5

Ind0.3FigIndthelowstatTra0.6

Fig

6 Weinto(traincrmoimpPerconappchanetwdepPA

ure 10: A grid

5.2.3 VariationFrom Sectio

dex with L=752 for worst,

g.11 shows hodex for PARToretical wors

west value of 0tionary nodesace Index is 0.6.

ure 11: Trace I

CONCLUSI

e have shown o stationary aace) preservatrease the efbility awareportance of rformance onditions hasplicability toaracteristics owork, nature

ployment topoARTROUTE

deployment of

n in Trace Indon 4.2, theor5 and K=300 a

mean and bow the simulTROUTE-150st, mean and 0.44 is observs. With 40% .6 which is be

Index Analysis

ION

how logicalland mobile notion over statffectiveness oe sensor n

energy-efficf PARTROU

been showo different of the nodes e of event ologies could

to bring

f nodes

dex retical values are given as 1best case reslation results 0 compare ag

best case leed for Trace Imobility, the

etter than mea

ly dividing thodes with partionary nodesof reactive rnetworks whciency is pUTE under wn to illus

situations. comprising t

traffic andd be used to

about s

of Trace , 0.66 and

spectively. for Trace

gainst the evels. The Index with observed

an value of

e network rtial route

s can help routing in here the aramount.

different strate its

Mobility the sensor d typical configure

significant

UbiCC Journal, Volume 6: Issue 2 855

improvements on all routing performance parameters. PARTROUTE can also find significant application with Body Sensor Networks where the mobility pattern of nodes can be determined with sensors like accelerometers. 7 REFERENCES [1] W. R. Heinzelman, A. Ch, and H. Balakrishnan:

Energy-efficient communication protocol for wireless microsensor networks, IEEE Proc. Hawaii Intl. Conf. Sys. Sci., pp. 1–10 (Jan. 2000).

[2] A. Manjeshwar and D. P. Agrawal: Teen: A routing protocol for enhanced efficiency in wireless sensor networks, Intl. Parallel and Distributed Processing Symp., vol. 3, pp. 2009–2015 ( 2001).

[3] D. Ganesan, R. Govindan, S. Shenker, and D. Estrin: Highly-resilient, energy-efficient multipath routing in wireless sensor networks, SIGMOBILE Mob. Comput. Commun. Rev., vol. 5, no. 4, pp. 11–25 (2001).

[4] R. C. Shah and J. M. Rabaey: Energy aware routing for low energy ad hoc sensor networks, Proc. of the IEEE Wireless Communications and Networking Conf. (WCNC), Orlando, Florida ( 2002).

[5] B. Karp and H. T. Kung: Gpsr: greedy perimeter stateless routing for wireless networks, MobiCom ’00: Proc. of the 6th Annual Intl. Conf. on Mobile Computing and Networking, New York, NY, USA: ACM, pp. 243–254 (2000).

[6] C. Intanagonwiwat, R. Govindan, and D. Estrin: Directed diffusion: A scalable and robust communication paradigm for sensor networks,” in MOBICOM, ACM, pp. 56–67 (2000).

[7] L. Wang, R. Zhang, and S. Geng: An energy-balanced ant-based routing protocol for wireless sensor networks, WiCOM’09: Proc. of the 5th Intl. Conf. on Wireless communications, Networking and Mobile Computing, Piscataway, NJ, USA: IEEE Press, pp. 3556–3559 (2009).

[8] D. B. Johnson and D. A. Maltz: Dynamic source routing in ad hoc wireless networks, Mobile Computing, ser., The Kluwer International Series in Engineering and Computer Science, T. Imielinski and H. F. Korth, Eds, Springer US, vol. 353, pp. 153–181 (1996).

[9] C. Perkins and E. Royer: Ad-hoc on-demand distance vector routing, Proc. of Second IEEE Workshop on Mobile Computing Systems and Applications, 1999. WMCSA ’99., pp. 90–100 (Feb. 1999).

[10] Y. Khamayseh, O. M. Darwish, and S. A. Wedian: Ma-aodv: Mobility aware routing protocols for mobile ad hoc networks, ICSNC ’09: Proc. of the 2009 Fourth Intl. Conf.

on Systems and Networks Communications, Washington, DC, USA: IEEE Computer Society, pp. 25–29 (2009).

[11] S. Ju and J. Evans: Mobility-aware routing protocol for mobile ad-hoc networks, IEEE Intl. Conf. on Communications Workshop, 2009, pp. 1–6 (Jun. 2009).

[12] M. Mathie, B. Celler, N. Lovell, and A. Coster: Classification of basic daily movements using a triaxial accelerometer, Medical and Biological Engineering and Computing, vol. 42, pp. 679–687, 2004.

[13] Q. Li, J. Stankovic, M. Hanson, A. Barth, J. Lach, and G. Zhou: Accurate, fast fall detection using gyroscopes and accelerometer-derived posture information, Sixth Intl. Workshop on Wearable and Implantable Body Sensor Networks, pp. 138–143 (2009).

[14] Chakeres, I. D., and L. Klein-Berndt: Aodvjr, aodv simplified, SIGMOBILE Mob. Comput. Commun. Rev., vol. 6, no. 3, pp. 100–101 (2002).

[15] C. E. Perkins, E. M. Belding-Royer, and S. Das: Ad hoc on-demand distance vector (aodv) routing, RFC 3561 (Jul. 2003).

[16] S. Sarangi and S. Kar: Performance analysis of an improved graded precision localization algorithm for wireless sensor networks, Intl. J. of Computer Networks & Comm. (IJCNC), vol. 2, no. 4, pp. 150–159 (Jul. 2010).

[17] S. Sarangi and S. Kar: Location estimation with reactive routing in resource constrained sensor networks, Intl. Conf. on Sensors and Related Networks (SENNET’09), vol. II, Vellore, India, pp. 563–567 (Dec. 2009).

UbiCC Journal, Volume 6: Issue 2 856