HAL Id: inria-00466140
https://hal.inria.fr/inria-00466140
Submitted on 22 Mar 2010
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Study on Dynamic Source Routing Protocols for Mobile Ad Hoc Networks
Jie Li, Hisao Kameda, Yi Pan
To cite this version:
Jie Li, Hisao Kameda, Yi Pan. Study on Dynamic Source Routing Protocols for Mobile Ad Hoc
Networks. WiOpt’03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar
2003, Sophia Antipolis, France. 2 p. �inria-00466140�
Mobile Ad Hoc Networks
Jie Li y
, HisaoKameda y
and Yi Pan z
y
Institute of Information Sciences and Electronics, University of Tsukuba
Tsukuba Science City, Ibaraki305-8573,Japan
z
Department of Computer Science, Georgia State University
University Plaza, Atlanta,GA 30303, USA
A mobileadhocnetwork(MANET)consistsofacollectionofwirelessmobilenodesthat arecapableof
communicatingwitheachother. Thereisnouseofastaticnetworkinfrastructuresuchasbasestationorany
centralizedadministrationinMANET.Duetothelimitedtransmissionrangeofwirelessnetworkinterfaces,
multiplehops(intermediatehosts)maybeneededforonehosttotransferdatatoanotheracrossthenetwork.
InMANET, each mobilehostmay operatenotonlyasaterminalbut also asarouter, forwardingpackets
from other mobile hosts. The mobile hosts are freeto movearound, thus changing thenetwork topology
dynamically. ThusroutingprotocolsforMANETshouldbeadaptiveandabletomaintainroutesinspiteof
changingthenetworkconnectivity. Suchnetworksareveryusefulinmilitaryandothertacticalapplications
suchas emergencyrescue orexplorationmissions, where staticcellularphone infrastructureis unavailable
orunreliable. Commercial applicationsare alsolikelywhere there isaneed forubiquitouscommunication
serviceswithoutthepresentoruseofaxednetworkinfrastructure.
Designand analysisofroutingprotocolsarethekeyissuesin MANET.TheprimarygoalofaMANET
routingprotocolistoestablishacorrectandeÆcientroutebetweenapairoftwohostsfordeliveringmessage
inatimelymanner. Manydierentroutingprotocols[2,3]havebeenproposedforMANETs. Theycanbe
classiedintotwocategories: table-drivenandon-demand.
Thetable-drivenroutingprotocolsaresimilartoandcomeasanaturalextensionofthoseforthewired
networksincludingInternet. Theyessentiallyuseproactiveschemes,whichattempt tomaintainconsistent
up-to-dateroutinginformationfromeachhosttoeveryothernodeintheMANET.Theseprotocolsrequire
eachhostto maintainoneormoretables tocontainlatestroutinginformation,andanychangein network
topology needs to be reected by broadcasting updates information throughout the network in order to
maintainaconsistentnetwork view.
Ontheother hand,the on-demandroutingprotocolstakealazy approachto routing. Themotivation
behindtheon-demandprotocolsistoreduce largeamountof overheadformaintainingtheroutingtablein
thetable-drivenprotocolsinthedynamicMANET.Theyaresource-initiatedschemeswhichdonotmaintain
orconstantlyupdate theirroute tableswith thelatest routetopology. This type ofroutingcreates routes
onlywhen desired by thesource node. Whenanode requires aroute toadestination, itinitiates aroute
discoveryprocesswithin thenetwork. This process is completed onceone ormoreroutes arefound orall
possibleroutepermutationshavebeenexamined. However,routingoverheadforon-demand protocolsmay
bestilllargemainlybecausetheoodingprocessusedindiscoveringroutes,wherethesource(i.e.,thehost
seekingaroute)oods theentirenetworkwithaquerypacketinsearchingarouteto thedestination.
The Dynamic Source Routing (DSR) protocol (e.g., [1, 4]) is one of the more generally accepted on-
demand routingprotocols. It is naturalto considerthe DSRprotocolwith multple routes sincetheymay
bebuiltduring theroutediscoverybyooding. TheDynamicSourceRouting(DSR) protocolproposedin
[1]alsohasanoptionofmaintainingmultipleroutes,sothat analternateroutecanbeuseduponfailureof
theprimaryone. Butin DSR[1],toomany routesaremaintainedin atrivialmanner, withoutanyregard
totheirultimateusefulness. Theperformancestudy ofDSRprotocolshasnotbeenconducted in[1].
The concept of multipath routing has been used for circuit switched and packet switched networks
、
as it provides an easy mechanism to distribute traÆc and balance the network load, as well as provide
faulttolerance. For MANET,theTemporallyOrderedRoutingAlgorithm(TORA) [5,6]providesmultiple
alternate pathsby maintaining a"destination-oriented" directed acyclicgraphfrom thesource. However,
DSRprotocol proposed in [4] , thesourcehostwillselect theshortestrouteto thedestination atrst and
willcacheallthealternaterouts. Iftherstroutebreaks,theshortestremainingalternaterouteisselected.
The process continues until all routes break, then a new route discoveryis initiated. In the second DSR
protocol,allintermediate nodesarenowequippedwith adisjoint,alternate route. Ifadata packet issent
into anintermediate hostand thelink connecting tothe nexthostis broken,the alternateroute from the
intermediatenodewillbeused forsendingthe allthelaterdata packets. Sincesomedatapacketsmaybe
lost dueto alinkbreak andthemessageaboutthe datalossmaynotbesentbackto thesourcehost,the
losingdatapackets maynotberesentandbelostpermanentlyin thesecondDSRprotocolin[4]. Because
of the possibility of lossingdata packets, we consider that the second DSR protocol cannot be used as a
practicalone.
WenotethataninterestinganalyticmodelisdevelopedforanalyzingtheperformanceofDSRprotocols.
Theperformanceusedintheanalysisisthetimeintervalbetweenroutediscoveriesforadatatransmissionin
anon-demandDSRprotocol. Thistimeintervalbetweenroutediscoveriesisalsothelifetimeofthemultiple
routesused forthedata transmission. Note that thelifetime foradatatransmissionchanges dynamically.
Ifthe lifetime foradata transmissionis shorterthanthe lifetime of multiple routes,it isnot necessaryto
havelonglifetimeofmultipleroutessincethedatatransmissionwillnishbeforethestartofthenextroute
discovery. On the other hand,the lifetime of a data transmissionmaybe longerenough which may need
morethantworoutediscoveries. Theperformancemetricusedin[4]doesnotreecttheperformanceofthe
DSRprotocolswell.
In this paper, we develop a comprehensive analytic model for the performance study of the multiple
route DSR protocol for MANET. At rst, weintroduce twoperformancemetrics. Therst metric is the
probabilitythatthe lifetimeof multiple routesislargerthanthelifetime ofadatatransmission. Itis easy
toseethatthelargertheprobabilityis,thebettertheperformanceofamultiplerouteDSRprotocolis. We
calltheprobabilityprobabilityofasuccessfuldatatransmission. Thesecondmetricistheprobabilitythatthe
multiple routes can be usedfor the next data transmission. Notethat in themultiple route DSRprotocol,
thelifetime ofmultipleroutesforasourceS todestinationDmaybelongerthanthetimeintervalbetween
twodata transmission. It meansthat someroutes used for adata transmission may also beavailable for
thenextdata transmission. Thesecond metricisused tostudy thepossibility ofusingmultiple routes for
thenextdatatransmission,whiletherstmetricshowstheprobabilityofusingmultipleroutesforonedata
transmission. Wederiveboththeprobabilityofasuccessfuldatatransmissionandtheprobabilitythatthe
multipleroutescanbeusedforthenextdatatransmissionforthegeneralcaseovernmultipleroutes. These
analytic resultsprovide insightsinto mechanics ofthe multiple DSRroutingprotocol. It isalso useful for
thedesignand implementationoftheon-demandroutingforMANET.
References
[1] J.Broch,D.JohnsonandD.Maltz,"DynamicSourceRoutinginWirelessAdHocNetworks,"inMobile
Computing,eds.T.ImielinskiandH.Korth(KluwerAcademic,1996)Chapter5.
[2] Yu-Liang Chang, Ching-Chi Hsu, "Connection-Oriented Routingin Ad HocNetworks Based on Dy-
namicGroupInfrastructure,"itProc.oftheFifthIEEESymposiumonComputersandCommunications
(ISCC2000),pp.587-593,July04-06,2000Antibes,France
[3] Ming-Hong Jiang, Rong-Hong Jan, "An EÆcient Multiple Paths Routing Protocol for Ad-hoc Net-
works,"The15thInternationalConferenceonInformationNetworking(ICOIN'01),January31-Febru-
ary02,2001BeppuCity,Oita,Japan,pp.544-549.
[4] A.Nasipuri,R.Castaneda andS.Das, "Performanceofmultipath routingforon-demandprotocolsin
mobileadhodnetworks,"ACM/Kluwer Mobile Networksand Applications, vol.6,no.4, pp.339-349,
2001.
[5] VincentD. ParkandM.ScottCorson,"AHighlyAdaptiveDistributedRoutingAlgorithmforMobile
WirelessNetworks,"Proc. ofIEEE INFOCOM '97,Kobe,Japan,April1997,pp.1405-1413.
[6] VincentD.ParkandM.ScottCorson,"APerformanceComparisonoftheTemporally-OrderedRouting
AlgorithmandIdeal Link-StateRouting,"Proc. of IEEE Symposium onComputers and Communica-
