Routing In Delay Tolerant networks

Seminar by Anubhav Mahajan 06111502709 C.S.E. 7th Sem

Abstract

Delay Tolerant et!or"#$DT #% are &romi#in' ne! (evelo&ment in net!or" re#ear)h *iel(. DT # are tho#e net!or"# !here in#tantaneou# en(+to+en( &ath# amon' no(e# may not be &o##ibly e#tabli#he( or are ab#ent *or a lon' &erio( o* time. ,ur&o#e o* thi# #tu(y !a# to #urvey DT routin' &roblem. -t in)lu(e# #tu(y o* DT routin' &roto)ol# ea)h o* !hi)h aim# at in)rea#in' the me##a'e (elivery &robability a# !ell a# re(u)in' . a# mu)h a# &o##ible. the overhea(# in)urre( (urin' the !hole (elivery &ro)e## o* the me##a'e. /en)e*orth. &er*orman)e o* the#e routin' &roto)ol# !ill be evaluate( u#in' the 0 E #imulator !hi)h i# (e#i'ne( #&e)i*i)ally to #imulate the#e routin' &roto)ol#.

Introduction

Delay Tolerant et!or"# are !irele## net!or"# !here (i#)onne)tion# an( (elay# may o))ur *re1uently (ue to &ro&a'ation &henomena #u)h a# no(e mobility. &o!er outa'e# et). DT )ome# into &lay !hen (elay# are ob#erve( (ue to non+ e2i#ten)e or lon' ab#en)e o* in#tantaneou# en(+to+en( &ath# amon' no(e#. 0ne o* the main rea#on# behin( the#e are untimely an( ran(om movement o* interme(iate no(e# $mobile ho#t#% that have to )arry (ata *rom any #our)e to (e#tination. -n or(er to a)hieve (ata (elivery. a 3#tore+an(+*or!ar(4 a&&roa)h i# ta"en !here (ata i# in)rementally move( an( #tore( throu'hout the net!or" in 3ho&e#4 that it !ill eventually rea)h it# (e#tination.

Objective of the study

To #urvey DT routin' &roblem. To #tu(y (i**erent DT routin' &roto)ol#. To #tu(y 0 E #imulator. ,er*orman)e evaluation o* DT routin' &roto)ol# u#in' the 0 E #imulator.

Review Of literature

DTN

DT )ome# into &lay !hen in#tantaneou# en(+to+en( &ath# amon' net!or" no(e# may not be &o##ible to e#tabli#h or are ab#ent *or a very lon' time. A 3#tore+an(+*or!ar(4 a&&roa)h i# ta"en !here (ata i# in)rementally move( an( #tore( throu'hout the net!or" in 3ho&e#4 that it !ill eventually rea)h it# (e#tination.

DTN and ad-hoc networks

DT )an be ren(ere( a# a #&e)ial )a#e o* A(+ho) net!or"# !here net!or" &artition# o))ur# very *re1uently an( that too *or a lon' &erio( o* time. Tra(itional A(+ho) net!or"in' routin' &roto)ol# re1uire# an &re+e2i#tin' in#tantaneou# en(+to+en( &ath bet!een #our)e an( (e#tination no(e# either (ire)tly or in(ire)tly throu'h interme(iate mobile no(e#. 5ut i* an in#tantaneou# en(+to+en( )onne)tivity i# *aile( to 'et e#tabli#he(. the#e &roto)ol# *ail# alon' !ith them. The#e *ailure# al#o in)lu(e# the )a#e# !here at the time o* ori'ination o* a me##a'e there !a# an in#tantaneou# en(+to+ en( )onne)tivity bet!een #our)e an( (e#tination !hi)h may not be &re#ent at the time !hen the me##a'e i# travellin' throu'h the &ath an( re#ult# in lo## o* me##a'e.

DTN applications and where AD- O! networks fails

-nter&lanetary -nternet. Mobile &o#t# aroun( the &lanet in)lu(in' #&a)e #tation# or &o#t# on terrain #u)h a# Antar)ti)a. Dee& #ea )ommuni)ation. Mobile military (e&loyment# a)ro## #ea# an( (e##ert#.

Routing in DTN

6outin' &roto)ol# !ill be u#e( to move me##a'e# en(+to+ en( a)ro## the net!or" !hi)h i# time varyin' a# !ell a# !ho#e (ynami)# are not "no!n in a(van)e. 7oal# o* a DT routin' &roto)ol are to8 1.% ma2imi9e me##a'e (elivery rate 2.% minimi9e me##a'e laten)y

:.% minimi9e the total re#our)e# )on#ume( in me##a'e (elivery #u)h a# bu**er #i9e# !ithin mobile ho#t#$)arrier#% (evote( to #tore other ho#t;# me##a'e# .ener'y o* the ho#t$)arrier% )on#ume( in #tora'e an( tran#mi##ion o* that me##a'e et).

"pide#ic Routing

A *loo(in' ba#e( DT routin' &roto)ol. Sim&ly ba#e( on ran(om &air+!i#e e2)han'e# o* me##a'e# that ta"e# &la)e amon' mobile ho#t# an( amon' i#lan(# o* mobile ho#t# to en#ure eventual me##a'e (elivery. Co&ie# o* a me##a'e !ill #&rea( li"e #ome e&i(emi) o* a (i#ea#e in the net!or". ultimately rea)hin' to it# (e#tination.

$essage e%change #echanis#

S< 8 Summary ve)tor Summary ve)tor o* a mobile ho#t i# a brie* #ummary o* me##a'e# that are )urrently &re#ent in the bu**er o* a mobile ho#t. =hen t!o mobile ho#t# )ome into )onta)t !ith ea)h other. they (e)i(e !hi)h me##a'e# are to be e2)han'e( bet!een them by loo"in' at other ho#t;# #ummary ve)tor.

&robabilistic routing

A )ontrolle( *loo(in' ba#e( DT routin' &roto)ol but !ith no ran(om &air+!i#e e2)han'e#. Me##a'e e2)han'e# are ba#e( on (elivery &re(i)tability !hi)h in(i)ate# ho! li"ely i# that thi# no(e !ill be able to (eliver a me##a'e to it# &arti)ular (e#tination. Delivery &re(i)tability i# mea#ure( on the ba#i# o* the number o* time# t!o ho#t# )ome# into )onta)t or the number o* time# a ho#t ha# #u))e##*ully (elivere( a me##a'e to a &arti)ular (e#tination throu'h tran#itivity. A me##a'e !ill be tran#*erre( *rom *ir#t no(e to #e)on( no(e i* an( only i* the #e)on( no(e have a hi'her value o* (elivery &re(i)tability than the *ir#t no(e *or the (e#tination o* that me##a'e.

'pray and wait

ot a *loo(in' ba#e( te)hni1ue. -t )on#i#t# o* t!o &ha#e# 8S&ray &ha#e an( =ait &ha#e. S&ray &ha#e8 Sour)e no(e !ill #&ray a limite( number o* )o&ie# o* the me##a'e into tho#e no(e# that have mu)h hi'her (elivery &re(i)tability than the #our)e no(e in ho&e that one o* the #&raye( no(e i# (e#tination it#el*. =ait &ha#e 8 -* the (e#tination i# not *oun( in the #&rayin' &ha#e. ea)h o* the no(e# )arryin' a me##a'e )o&y trie# to &er*orm# (ire)t tran#mi##ion $i.e. !ill *or!ar( the me##a'e only to it# (e#tination%. -* #till not #u))e##*ul then #&rayin' &ha#e !ill be'in a'ain a*ter !aitin' *or #ome &re+#&e)i*ie( time &erio(.

Dyna#ic 'ocial (rouping

5a#e( on *ormation o* #o)ial 'rou&#. A##ume# that no(e# that are a##i'ne( to the #ame #o)ial net!or" $)la##room. &roje)t team% !ill re'ularly intera)t !ith member# o* that #o)ial 'rou&. =ith the#e 'rou&# i(enti*ie(. )on#i#tent route# to!ar(# &arti)ular (e#tination# are i(enti*ie( ba#e( on the (elivery hi#tory o* a 'rou& or no(e. To (eliver a me##a'e to a member or member# o* a &arti)ular 'rou& . #im&ly tran#*er the me##a'e to a no(e !hi)h re'ularly intera)t# !ith any member o* that 'rou&. 6e#t. that member o* the 'rou& !ill #&rea( the me##a'e to all the member# o* that 'rou&.

Research and #ethodology

Opportunistic Networking environ#ent

Simulation tool. (evelo&e( in >ava. u#e( *or &ro)e##in' o* DT routin' &roto)ol#. -t ha# been (e#i'ne( #&e)i*i)ally *or DT routin' &roto)ol# an( a&&li)ation#. ,rovi(e# intera)tive vi#uali9ation an( &o#t+&ro)e##in' tool#.

)asic process

?ir#t !e !rite im&lementation o* a DT routin' &roto)ol in the *orm o* >A<A )la##e# !hi)h are *e( into 0 E #imulator. !hi)h it#el* i# a )olle)tion o* java )la##e# an( &a)"a'e#. 0 E #imulate# the &roto)ol a# &er our #&e)i*i)ation#. A# a re#ult. it 'enerate# a (etaile( re&ort on &er*orman)e evaluation o* the &roto)ol a# &er #imulation.

?ee(e( >ava Cla##e#

S&e)i*i)ation#

Simulation Data

6e&ort

Analysis and discussion

&ara#eters

,er*orman)e o* DT routin' &roto)ol# !ill be evaluate( on the ba#i# o* #ome #&e)i*ie( &arameter#. The#e are 8 1.% ,er)ent me##a'e# (elivere( u#in' that &roto)ol. 2.% Avera'e laten)y o* (elivere( me##a'e#. :.% Total number o* tran#mi##ion#. @.% /o& )ount &er me##a'e. 5.% Avera'e overhea( &er me##a'e. A*ter #imulatin' a DT &roto)ol. a# &er our &re+#&e)i*ie( )on*i'uration#. the re&ort o* &er*orman)e o* the &roto)ol !ill be 'enerate( in term# o* the#e &arameter#.

!riteria

?ir#t !e &rovi(e a )on*i'uration to 0 E over !hi)h the#e &roto)ol# !ill be #imulate( turn by turn. Thi# )on*i'uration in)lu(e# 8 1.% The ma&A#)enario over !hi)h no(e# !ill roam. 2.% The number o* no(e# in the #)enario. :.% The bu**er #i9e at ea)h no(e.

Then on the ba#i# o* *ollo!in' t!o )riteria. &er*orman)e o* ea)h DT routin' &roto)ol !ill be evaluate( an( )om&are(. The#e are 8

1.% ,arameter v#. <ariable 5u**er Si9e "ee&in' number o* no(e# *i2e( in the #)enario. 2.% ,arameter v#. <ariable no(e )ount "ee&in' bu**er #i9e o* ea)h no(e *i2e( in the #)enario.

!onclusion

Su))e##*ul #urvey o* DT routin' &roblem. Su))e##*ul #tu(y o* (i**erent DT routin' &roto)ol#. Su))e##*ul #tu(y o* the 0 E #imulator an( it# !or"in'. Su))e##*ul &er*orman)e evaluation o* DT routin' &roto)ol# u#in' the re&ort# 'enerate( by the 0 E #imulator.

'cope for future

-nve#ti'ation# *or other *or!ar(in' #trate'ie# that )an enhan)e the &er*orman)e o* DT *urther. There i# mu)h #)o&e *or a((ition o* more maturity to the 0 E #imulator . Thi# in)lu(e# more *un)tionalitie# #u)h a# automati) )om&ari#on# amon' DT &roto)ol# on the ba#i# o* &arameter# rather than ma"in' u# (o manual )om&ari#on#. Stan(ar(i9ation o* (ata !hi)h i# u#e( *or #imulatin' DT &roto)ol# on the 0 E #imulator.

References

B1C A. <ah(at an( D. 5e)"er. 3E&i(emi) routin' *or &artially )onne)te( a(ho) net!or"#.4 Du"e Dniver#ity. Te)h. 6e&.. 2000.E B2C 6oy Cabani##. Sanjay Ma(ria. 7eor'e 6u#h. Abbey Trotta an( Sriniva#a S. <ulli De&artment o* Com&uter S)ien)e. 3Dynami) So)ial 7rou&in' 5a#e( 6outin' in a Mobile A(+/o) et!or"4Mi##ouri Dniver#ity o* S)ien)e an( Te)hnolo'y. 6olla. Mi##ouri 65@01. S)hool o* Com&utin' an( En'ineerin'.Dniver#ity o* Mi##ouri. Fan#a# City. Mi##ouri 6@110 B:C Thra#yvoulo# S&yro&oulo#. Fon#tantino# ,#ouni# an( Cauli'i S. 6a'haven(ra. 3S&ray an( =ait8 An E**i)ient 6outin' S)heme *or-ntermittently Conne)te( Mobile et!or"#4E B@C Su#hant >ain. Fevin ?all. 6abin ,atra 36outin' in a Delay Tolerant et!or"4 B5C An(er# Gin('ren. Avri Doria. 0lov S)helHen 3,robabili#ti) 6outin' in -ntermittently Conne)te( et!or"#4

References
B6C htt&#8AA!!!.netlab.t"".*iAtut"imu#A(tnAtheoneA B7C htt&#8AAcrawdad.)#.(artmouth.e(uAdata.&h&

BIC htt&#8AA!!!.!i"i&e(ia.or'

T AN* +O,