Packet Loss in Mobile Ad Hoc Networks(8)

Abstract — We investigate packet loss in mobile ad hoc networks via simulation. Ad-hoc on-demand distance vector (AODV) and destination-sequenced distance vector (DSDV) are chosen as representatives of the on-demand and proactive routing protocols respect

work-widepacketlossovertwoordersofmagnitude

DSDVloses10%to20%morepacketsthanAODVdoesforUDPtraf c.ForTCPtraf c,thepacketlossforDSDVisahalfofthatforAODV.DSDVoutperformsAODVbecausethecongestioncontrolmechanismofTCPgreatlyreducescongestion-relatedloss.

Increasingcommunicationrequestortraf cloadhasastrongerimpactonpacketlossinthelessstressfulsituation(i.e.,10connectionsatarateof4packets/s).

Hostmobilitydecreasespacketloss,givenlightcommunicationrequestandtraf cload.Forothercases,packetlossisratherstablewithhostmobility. Alwayssendingpacketsviatheshortestpathmaycausecongestionatafewheavilyburdenedhosts. Packetlossdistributionovertimeexhibitscertainextentofself-similarpattern.

Inspiredbythiswork,weareinterestedininvestigat-ingtherelationshipbetweenshortestpathandconges-tion.WeareworkingonalosssensitiveroutingprotocoltosupportnetworklayercongestioncontrolforbothUDPandTCPtraf c.Wearestudyingwhetherpacketlossprocesshasfractalcharacteristics.Ourultimategoalistobuildasolidfoundationfortheresearchonroutingand owcontrolalgorithmsformobileadhocnetworks.

REFERENCES

[1]S.R.Das,R.Castaeda,andJ.Yan,“Simulation-basedper-formanceevaluationofroutingprotocolsformobileadhocnetworks,”MobileNetworksandApplications,vol.5,pp.179–189,2000.

[2]D.B.JohnsonandD.A.Maltz,“Dynamicsourceroutinginad

hocwirelessnetworks,”MobileComputing,pp.153–181,1996.

8

[3]C.E.Perkins,E.M.Belding-Royer,andS.R.Das,“Adhoc

on-demanddistancevector(AODV)routing,”IETFInternetDraft./internet-drafts/draft-ietf-manet-aodv-11.txt,June2002.

[4]C.E.Perkins,E.M.Royer,S.R.Das,andM.K.Marine,

“Performancecomparisonoftwoon-demandroutingprotocolsforadhocnetworks,”IEEEPersonalCommunications,vol.8,no.1,pp.16–28,Febuary2001.

[5]T.Camp,J.Boleng,B.Williams,L.Wilcox,andW.Navidi,

“Performancecomparisonoftwolocationbasedroutingpro-tocolsforadhocnetowkrs,”inProceedingsofIEEEInfocom2002,NewYork,June2002.

[6]R.V.BoppanaandS.P.Konduru,“Anadaptivedistancevector

routingalgorithmformobile,adhocnetworks,”inProceedingsofIEEEInfocom2001,vol.3.Anchorage,Alaska:IEEE,April2001,pp.1753–1762.

[7]I.Cidon,A.Khamisy,andM.Sidi,“Analysisofpacketloss

processinhigh-speednetworks,”IEEETransactionsonInfor-mationTheory,vol.39,no.1,pp.98–108,January1993.

[8]J.-C.Bolot,“End-to-endpacketdelayandlossbehaviorin

theinternet,”inConferenceproceedingsonCommunicationsarchitectures,protocolsandapplications.ACMPress,1993,pp.289–298.

[9]C.E.PerkinsandP.Bhagwat,“Highlydynamicdestination-sequenceddistance-vectorrouting(DSDV)formobilecomput-ers,”inProceedingsoftheSIGCOMM94ConferenceonCom-municationsArchitectures,ProtocolsandApplications,August1994,pp.234–244.

[10]S.BiazandN.H.Vaidya,“Distinguishingcongestionlosses

fromwirelesstransmissionlosses:Anegativeresult,”inPro-ceedingsofIEEEICCCN1998,NewOrleans,October1998,pp.722–731.

[11]F.AnjumandL.Tassiulas,“Onthebehaviorofdifferenttcpal-gorithmsoverawirelesschannelwithcorrelatedpacketlosses,”inProceedingsoftheinternationalconferenceonMeasurementandmodelingofcomputersystems.ACMPress,1999,pp.155–165.

[12]kshman,U.Madhow,andB.Suter,“Tcp/ipperformance

withrandomlossandbidirectionalcongestion,”IEEE/ACMTransactionsonNetworking(TON),vol.8,no.5,pp.541–555,2000.

[13]L.Technologies,“WaveLAN/PCMCIAcarduser’sguide,”Oc-tober1996.

[14]J.Broch,D.A.Maltz,D.B.Johnson,Y.Hu,andJ.Jetcheva,

“Aperformancecomparisonofmulti-hopwirelessadhocnetworkroutingprotocols,”inProceedingsofthefourthannualACM/IEEEinternationalconferenceonMobilecomputingandnetworking.ACMPress,1998,pp.85–97.

[15]Y.Lu,W.Wang,Y.Zhong,andB.Bhargava,“Performance

studyoftwodistancevectorroutingprotocolsformobileadhocnetworks,”CSDept.,PurdueUniversity,Tech.Rep.TR-02-016,2002.

[16]M.MarinaandS.Das,“On-demandmultipathdistancevector

routinginadhocnetworks,”inProceedingsoftheInternationalConferenceforNetworkProtocols(ICNP),November2001.