Analyzing discovery latency in mobile networks

Graduate Theses, Dissertations, and Problem Reports

2017

Analyzing discovery latency in mobile networks Analyzing discovery latency in mobile networks

Saud Alramzi

Follow this and additional works at: https://researchrepository.wvu.edu/etd

Recommended Citation Recommended Citation Alramzi, Saud, "Analyzing discovery latency in mobile networks" (2017). Graduate Theses, Dissertations, and Problem Reports. 3995. https://researchrepository.wvu.edu/etd/3995

This Problem/Project Report is protected by copyright and/or related rights. It has been brought to you by the The Research Repository @ WVU with permission from the rights-holder(s). You are free to use this Problem/Project Report in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you must obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/ or on the work itself. This Problem/Project Report has been accepted for inclusion in WVU Graduate Theses, Dissertations, and Problem Reports collection by an authorized administrator of The Research Repository @ WVU. For more information, please contact [email protected].

https://researchrepository.wvu.edu/

https://researchrepository.wvu.edu/

https://researchrepository.wvu.edu/etd

https://researchrepository.wvu.edu/etd?utm_source=researchrepository.wvu.edu%2Fetd%2F3995&utm_medium=PDF&utm_campaign=PDFCoverPages

https://researchrepository.wvu.edu/etd/3995?utm_source=researchrepository.wvu.edu%2Fetd%2F3995&utm_medium=PDF&utm_campaign=PDFCoverPages

mailto:[email protected]

i

ANALYZINGDISCOVERYLATENCYINMOBILENETWORKS

SaudAlramzi

ProblemReportsubmittedtothe

BenjaminM.StatlerCollegeofEngineeringandMineralResources

atWestVirginiaUniversity

inpartialfulfillmentoftherequirementsforthedegreeof

MastersofScience

in

ElectricalEngineering

VinodKulathumani,Ph.D,Chair

XinLi,Ph.D

YanfangYe,Ph.D

LaneDepartmentofComputerScienceandElectricalEngineering

Morgantown,WestVirginia

2017

Keywords:neighbordiscovery,discoverylatency,disco,manet

Copyright2017SaudAlramzi

ii

ABSTRACT

AnalyzingDiscoveryLatencyinMobileNetworks

SaudAlramzi

Duty cycle is important in wireless sensor andmobile ad-hoc networks (MANETs) to

extendtheirlifetime.Dutycyclinginwirelessnetworksletsthenodeswakeupwithinfrequent

fixedperiods,basedonpre-determinedparameters.Ontheotherhand,neighbordiscoveryis

theprocessbywhichnodeslearnabouttheneighbors.Nodescanuseradiocommunicationsto

discover other neighbors. Timely, neighbor discovery is crucial for routing. But, neighbor

discovery becomes more challenging in energy-constrained, mobile environment with duty

cyclednodeswhereanodemaynotknowwhetheranyneighborsarepresent,andwhatduty

cyclethoseneighborsmightoperateat.

Discoisanasynchronousneighbordiscoveryandrendezvousprotocolthatallowstwoor

more nodes to operate their radios at low duty cycles (1-2%). Disco obtains discovery and

communication during infrequent, opportunistic encounters without requiring a global

synchronizationinformation.Disconodespickapairofdissimilarprimenumbersuchthatthe

sumoftheirreciprocalisequaltothedesireddutycycle.Aglobalcounterincrementswithafixed

period.Ifoneofthenode’sprimenumbersisdivisiblebythecounter,thenodewillturnonits

radioforoneperiod.Thisprotocolensuresthattwonodeshavesomeoverlappingradioon-time

withintheboundaryoftheperiod,anddiscovereachotherdespiteoftheindependentsetof

dutycycle.

Inthisreport,weseektounderstandhowDiscoperformsinmobilenetworks.Weanalyze

theimpactofdifferentdutycycles,mobilityspeedsandnetworksizesondiscovery latency in

extrememobilenetworks.WealsoscrutinizehowfastDiscodiscoversthatnodeshavemoved

outoftheirneighborhood.WeuseNS3tosimulateDiscowithdifferent,dutycycles,mobility

speeds,andnetworksizes.

iii

Acknowledgements

First,IwouldwanttothankmycommitteechairandadvisorDr.VinodK.Kulathumanifor

constantsupport,providingmeanopportunitytoworkwithhimandguidingmethroughoutmy

Master’sprogram.Also,IwouldliketoextendmywarmacknowledgmentstobothDr.XinLiand

Dr. Yanfang Ye for taking their courses in Image Processing and Advanced Data Mining

respectively,andforbeingpartofmycommittee.

Inaddition,IwouldespeciallyliketothankmyfamilymembersandmylovelywifeMrs.

DalalKamal,forhergenerousandunfailingsupportandcontinuousencouragementthroughout

myyearsofstudyandthroughtheprocessofresearchingandwritingthisdissertation.

Furthermore, Iwould liketothankallmyfriendsfortheirsuggestionsandhelpingme

overcomeallthetoughtimesinMorgantown,especiallyMr.MrwanBenIdris,andMs.Sowmya

Devaraja.

Last but not least, I would want to thank all of the faculty members in the Lane

DepartmentofComputerScienceandElectricalEngineeringforsharingexpertise,andsincere

andvaluableguidanceandencouragementextendtome.

iv

TableofContents

Chapter1Introduction...........................................................................................1

1.1 Overview............................................................................................................................1

1.2 SummaryofContributions.................................................................................................4

1.3 Outline................................................................................................................................5

Chapter2ReviewofPriorwork..............................................................................6

2.1 BirthdayProtocol...............................................................................................................6

2.2 Quorum-basedProtocol.....................................................................................................6

2.3 U-ConnectProtocol............................................................................................................6

2.4 DiscoProtocol....................................................................................................................6

Chapter3DesignandImplementations.................................................................11

3.1 Design...............................................................................................................................11

3.2 ExperimentalSetup..........................................................................................................13

Chapter4Results.................................................................................................18

4.1 DiscoveryLatency.............................................................................................................18

4.1.1 DifferentDutyCycles............................................................................................18

4.1.2 DifferentMobilitySpeeds.....................................................................................18

4.2 FailingLatency..................................................................................................................20

4.2.1 DifferentDutyCycles............................................................................................20

4.2.2 DifferentMobilitySpeeds.....................................................................................23

Chapter5FutureWorkandConclusion................................................................28

5.1 FutureWork.....................................................................................................................18

5.2 Conclusion........................................................................................................................18

References................................................................................................................29

v

ListofFigures

Figure4.1 TheDiscoveryLatencyfor50nodesandthemobilityofnodesis2-4m/s.............3

Figure4.2 TheDiscoveryLatencyfor50nodesandthemobilityofnodesis3-7m/s.............7

Figure4.3 TheDiscoveryLatencyfor50nodesandthemobilityofnodesis7-15m/s...........8

Figure4.4 TheDiscoveryLatencyfor50nodesandthemobilityofnodesis15-25m/s.......15

Figure4.5 TheDiscoveryLatencyfor100nodesandthemobilityofnodesis2-4m/s.........18

Figure4.6 TheDiscoveryLatencyfor100nodesandthemobilityofnodesis3-7m/s.........19

Figure4.7 TheDiscoveryLatencyfor100nodesandthemobilityofnodesis7-15m/s.......23

Figure4.8 TheDiscoveryLatencyfor100nodesandthemobilityofnodesis15-25m/s.....24

Figure4.9 TheDiscoveryLatencyfor50nodesandnodes’dutycycleis1%........................25

Figure4.10 TheDiscoveryLatencyfor50nodesandnodes’dutycycleis10%......................26


Figure4.12TheDiscoveryLatencyfor50nodesandnodes’dutycycleis30%......................28

Figure4.13 TheDiscoveryLatencyfor50nodesandnodes’dutycycleis50%........................7



Figure4.16 TheDiscoveryLatencyfor100nodesandnodes’dutycycleis10%....................18




Figure4.20 TheDiscoveryLatencyfor100nodesandnodes’dutycycleis100%..................25

Figure4.21 TheFailingLatencyfor50nodesandthemobilityofnodesis2-4m/s................26

vi


Figure4.23TheFailingLatencyfor50nodesandthemobilityofnodesis7-15m/s..............28

Figure4.24 TheFailingLatencyfor50nodesandthemobilityofnodesis15-25m/s..............3



Figure4.27 TheFailingLatencyfor100nodesandthemobilityofnodesis7-15m/s............15

Figure4.28 TheFailingLatencyfor100nodesandthemobilityofnodesis15-25m/s..........18

Figure4.29 TheFailingLatencyfor50nodesandnodes’dutycycleis1%............................19

Figure4.30 TheFailingLatencyfor50nodesandnodes’dutycycleis10%...........................23



Figure4.33 TheFailingLatencyfor50nodesandnodes’dutycycleis50%............................3

Figure4.34 TheFailingLatencyfor50nodesandnodes’dutycycleis100%..........................7

vii

ListofTables

Table3.1Examplesforapairofprimenumbersfor1%,10%,and20%dutycycle.................2

Table3.2Threedifferentcaseswhentwonodeshavea1%dutycycle.................................10

Table3.3Theexperimentparameters....................................................................................10

Table4.1Percentagesofundiscoveredneighbors’nodesforFigure4.19network...............16

1

Chapter1

Introduction

1.1 OverviewDutycycleisimportantforwirelesssensorandmobilead-hocnetworks(MANETs).The

devicesintheMANETaretermedasnodes.Node’sdutycycledeterminesitsactivetime.A60%

dutycyclemeansthenodeisactivefor60%ofthetimebutofffor40%ofthetime.Byvarying

thedutycycleratio,wecanletthenodewakeupwithinfrequentfixedperiods.

Neighbordiscoveryinmobilenetworksistheprocessinwhichnodeslearnabouttheir

neighbors.Neighbordiscovery isdivided intotwoparts, the firstpart iswhennodesdiscover

their neighbors. The second part is when nodes discover their neighbors are no longer in

communicationrange.Neighbordiscoveryhasprovenchallengingbecauseofchangingtopology

andnoinformationregardingthewake-upschedulesoftheneighbornodes.Tominimizeenergy

consumption,thenodesusuallyapplyduty-cyclingtotheirradios,whichmeanstheyrepeatedly

switchontheirradiosandsleep.Asuccessfuldiscoverycantakeplaceifandonlyifoneradio

listensonthechannelatthesamepoint intimeatwhichanotheronesendsapacket.Asthe

clocksofthesedevicesarecompletelyunsynchronized,thepointintimewhentwodevicesmeet

forthefirsttimeisrandom.

Minimizingdiscoverylatencytimesisvitalforthesuccessofroutingprotocolsinmobile

networks.Thisincludesdiscoveringnewneighborsanddiscoveringthattheexistingneighbors

havefailedbecauseofnodemobility.Thelatencytodiscovernewneighborsisdiscoverylatency,

while the latency to discover that nodes havemoved out of communication range is failing

latency.Bothlatencieshavetobesmalltoensurescalablerouting,asexplainedbytherepair

timescalingwall.

2

The repair timescalingwall [8]occursbecauseasnetworksize increases, theaverage

durationthatapathremainsconnecteddecreases,whiletheaveragedurationtorepairapath

remains constant. When the average path connectivity interval falls below the path repair

interval,thescalingwall isreached.Ithasbeenshownthatthepathrepair interval isroughly

equaltothelinkfailureestimationdelayinthesystem.Thus,fasterlinkdiscoveryiscriticalfor

extendingthescalabilityofroutingprotocolsforMANETs.

Asynchronousnetworksrefertonodesthathaveindependentdutycycles,andhaveno

informationaboutothernodesinthenetwork.Whendesireddutycycleisassignedtothenodes,

itisverydifficulttoachieveneighbordiscovery. Operatingaradioatlowdutycycleandensuring

thediscoverytobefast,reliable,andpredicableoverarangeofcommunicationisachallenge.

Asynchronous duty cycles are advantageous as they reduce collisions. The various neighbor

discoveryprotocolsareBirthdayprotocol,Quorum-basedprotocol,discoandsoon.Theresults

ofBirthdayprotocolandQuorum-basedprotocolhaveproblemswithasynchronousneighbor

discovery.[2,6]

Discoisanasynchronousneighbordiscoveryprotocolthatallowstwoormorenodesto

operatetheirradiosatlowdutycycles,andyetstilldiscoverandcommunicatewithoneanother

duringinfrequentperiodswithoutrequiringanypriorsynchronizationinformation[4].Indisco,

nodespickapairofprimenumbersuchthatthesumoftheirreciprocalsisequaltothedesired

dutycycle.Eachnodeincrementsalocalcounterwithaglobally-fixedperiod.Ifanode’slocal

countervalue isdivisiblebyoneof itsprimenumbers,thenodewill turnon itsradioforone

period.

In [4], the cumulative distribution of discovery latencies for disco is compared with

BirthdayandQuorumprotocolsoperatingat5%dutycycle.It’sproventhatDiscoachievesbetter

neighbor discovery than these protocols. Disco protocol is a practical solution to the

asynchronousneighbordiscovery,andrendezvousproblemthatworksbyschedulingradiowake

timesatmultiplesofprimenumbers,whichensuresdeterministicpairwisediscoveryandmimic

thediscovery latencies.The relationshipbetween slot length,beacon rate,discovery latency,

3

discovery rate, and duty cycle has been analyzed. The disco protocol has been validated for

limitednetworksizesanddutycycles.

Theobjectiveofthisworkistovalidatethediscoprotocolinmobilenetworks,

forlargenetworksizesundervarieddutycycles.

1.2 SummaryofContributionsInthiswork,in-depthanalysishasbeendoneontheconceptofDiscoprotocol.SinceDisco

protocolwasonlyvalidatedon limiteddutycyclesandsmallnetworkssizes, theresultswere

basedon:

• WeimplementedandverifiedthatDiscoensuresdiscoveryinmobilenetworks.

• WeanalyzedbothdiscoveryandfailinglatenciesinmobilenetworksusingDisco

protocolusingnetworksimulator,ns3fornetworksizes50,and100nodesunder

differentnodespeeds,dutycycles,anddensities.

• Wecomparebothdiscoveryandfailinglatenciesinnetworkswithfixedmobilityspeed

versusvariousdutycycles.

• Wecomparebothdiscoveryandfailinglatenciesinnetworkswithfixeddutycycle

versusvariousmobilityspeeds.

1.3 OutlineThe rest of our reportwill be organized as follows. In chapter 2,we discuss in detail

regarding the neighbor discovery and neighbor discovery protocols, in particular about disco

protocol.Wepresentthedesignaspectsofthediscoprotocolinchapter3.Inchapter4wehave

briefedtheimplementationdetailsformobilenetworks.Wehaveanalyzedneighbordiscovery

protocolformobilenetworksbypresentingthesimulationresultsobtainedbyns-3simulations

inchapter5.Inchapter6and7wepresentthefutureworkandconclusion.

4

Chapter2

Background

Neighbordiscoveryhasbeenachallengeinbothsensorandwirelessnetworks.Inthese

networks,neighbordiscoveryandenergyefficiencyaresignificant.So,neighbordiscoveryisa

challenge inmobile networks. In this section, wewill discuss some of the existing neighbor

discoveryprotocolsandtheirconsequences.

The twoneighbordiscovery typesare synchronousandasynchronous. In synchronous

neighbordiscovery,nodesinthenetworkknowthewakeuppatternsoftheirneighbors.Onthe

other hand, in asynchronous neighbor discovery, nodes do not have any information on

neighbors’wake-upschedules[7].Inourwork,wewillexploremoreonasynchronousneighbor

discoveryprotocols.

2.1BirthdayProtocol“Birthday” protocol [2] proposed byMcGlynn and Borbash is a probabilistic protocol.

Birthdayprotocoluses random independent transmissions todiscoveradjacentnodes. In this

protocol,thenodeschoosetostayinastate(transmit,listenorenergysaving)foratimeslot.

Thus,thenodewhichwantstosharediscoverymessageshouldbeintransmitstateandnode

whichisintendedtoreceivethediscoverymessageshouldbelistenstate.Onlywhenthestates

overlapinthispattern,theneighborswillbesuccessfullydiscovered.Energysavingstateisan

idlestate.Althoughitisanefficientsaving-energyprotocolforstaticadhocnetworks,itdoesnot

providepredictablerendezvoustimesandexhibitsalongtailfordiscovery.Thisprotocolisnot

suitablefornetworkwithchangingtopology.

5

2.2Quorum-basedProtocolQuorum-basedprotocol[6]proposedbyTsengetal.isapower-savingneighbordiscovery

protocolformulti-hopadhocnetwork.Inthisprotocol,acommondutycycleisusedbyallthe

nodes in the network. This ensures that nodes know the wake-up time of the node to

communicatewith.TheconceptoftheprotocolistoletnodessendbeaconsO(1/n)ofthebeacon

intervals.Thesequenceofbeaconintervalisdividedintosetsofcontinuous𝑛"where𝑛aglobal

parameterindicatingthedutycycle.

Ineachsetonintervals,the𝑛"intervalsarearrangedasa2-dimentional𝑛×𝑛arrayina

row-majormanner.Onthe𝑛×𝑛array,anodearbitrarilypicksonecolumnandonerowofentries

totransmitandreceive,respectively,atotalof2𝑛 − 1intervalsineachsetof𝑛"intervals.Since

𝑛isaglobalconstantparameter,allnodeshavethesamedutycycle,whichlimitstheflexibility

of theQuorumprotocol.Thus,Quorum-basedprotocol lacksasynchronousdutycycles in the

network.

2.3U-ConnectProtocolU-Connectprotocol[1],proposedbyKandhalu,Lakshmanan,andRajkumarisaneighbor

discoveryprotocol thatachievesneighbordiscoveryatminimalwithsavingenergycosts, ina

symmetric/asymmetricasynchronousduty-cycledneighbordiscovery.Thedesignisasfollows,

eachnodepicksaprimenumberpandstaysactivefor1everypslots,andnodeswilldiscover

oneanother.Theyalsoexcludethecaseifprimeis2.

2.4DiscoProtocolDiscoisanasynchronousneighbordiscoveryandrendezvousprotocolthatallowsnodes

discovereachotheratlowdutycycle[4].Discoensuresdeterministicpairwisediscoverywithout

requiringglobalcoordinationofdutycycles.

ThisapproachisadoptedfromSunZi’stwo-milleniaoldChineseRemainderTheoremand

ensuresdiscoveryinboundedtime,evenifnodesindependentlychoosetheirprimenumbers.

TheChineseRemainderTheoremrequiresco-primestoguaranteeasolutiontothesimultaneous

6

congruencies[5].Theprotocolisasstated,eachnodeselectsapairofprimenumbers,suchthat

the desired duty cyclewill be the sum of their reciprocals. Each nodewill stay active if the

counter/timerisdivisiblebyoneofitsprimes.

Inthisprotocol,symmetric(allnodesusesamedutycycle)andasymmetric(nodesuse

differentdutycycle)primepairswereconsidered.Resultshaveshownthatasymmetricprime

pairsdramatically reducethediscovery latency,by30-50%.Discoprotocolachievesdiscovery

fasterthantheotherneighbordiscoveryprotocolsforasynchronousdutycycles,allowsnodesto

independentlyselecttheirowndutycycle.Hence,theprotocoloffersaprovableupperboundon

discoverylatency,andperformsbetterthanexpectedinpractice.

7

Chapter3

DesignandExperimentalsetup

Discoalgorithmrandomlychoosesapairofprimenumberfornodessuchthatthesumof

theirreciprocalsisequaltothedesireddutycycle.Inthissection,wewillillustratein-depthabout

theDiscoalgorithm.

3.1Design

ChoosingPrimes

Itismoreefficienttochooseprimessuchthat,thereciprocalofoneoftheprimeisclose

tothedutycycle,whiletheotherprimenumberisrelativelylarge.Itisensuredthatsumofthose

reciprocalswillbeclosetothedesireddutycycle.This isbecausewhenoneofthereciprocal

node’s prime number is close to the desired duty cycle, its wake-up schedule will be more

efficient.For instance,consideranetworkof1%dutycycle(as intable3.1),nodecanchoose

primepairsof(139,479),(131,457),andsoon.Thefirstpair’sdutycyclewillgetclosetoa0.93%,

whichiscloseto1%.Asamatteroffact,anodecannotchooseasamepairofprimes(i.e.anode

chooses211and211).Table3.1demonstratesthecalculationofnodesprimenumberandits

desireddutycyclecalculation.

Table3.1:Examplesofapairofprimenumbersfor1%,10%and20%dutycycle.

Nodepairofprimes Desireddutycycle Sumofthereciprocal Node’sdutycycle

(139,479) 1% 1139

+1479

= 61866581

0.928%

(23,37) 10% 123

+137

= 60851

= 0.07 7%

(7,47) 20% 17+147

= 54329

= 0.164 16.4%

8

Whenacounterisdivisiblebyoneofthenode’sprimenumbers,thenodewillturnonits

radioandbeaconsforafixedperiodtermedasslotduration.Furthermore,iftwoormorenodes

turnontheirradiosduringthesameperiod,thentheycanexchangebeaconsanddiscovereach

other.AsindicatedinTable3.1,thenodesdutycyclescannotbespecifiedwithfinegranularity,

especiallywithlargedutycycles.Terminologiesusedinourschemeisasfollows.

Definition1:Discovery

Itreferstotheprocessbywhichnodeslearnabouttheircurrentone-hopneighborsforthefirst

time.

Definition2:DiscoveryLatency(DL)

Discovery latency will be the time taken by the node to first discover once they become

neighbors.Itreferstothedelaybetweenthetimetwonodesareincommunicationrange(𝑇4),

tothetimewhentheyfirstdiscovereachother(𝑇567).

𝐷𝑖𝑠𝑐𝑜𝑣𝑒𝑟𝑦𝐿𝑎𝑡𝑒𝑛𝑐𝑦, 𝐷𝐿 = 𝑇567 −𝑇4

where,𝑇567 indicateswhentwonodes’radiosareoverlappingwhiletheyareinneighborhood.

Definition3:FailingLatency(FL)

Failinglatencyisobservedonlyamongstthenodesthathavebeendiscoveredalready.Itrefers

tothedelaybetweenthetimetwonodesarenotincommunicationrange(𝑇E),tothetimewhen

thetwonodeshavealreadylearnedabouteachother’swake-uppatterns(𝑇56F).

𝐹𝑎𝑖𝑙𝑖𝑛𝑔𝐿𝑎𝑡𝑒𝑛𝑐𝑦, 𝐹𝐿 = 𝑇56F −𝑇E

where,𝑇56F indicatesthatwhentwonodesshouldbeactiveinthesameperiodbuttheyarenot

neighbors.Table2showstheequationsofbothdiscoveryandfailinglatencies.

9

ChoosingPrimes

Theprimenumberschosenwillcontrolthewake-uptimeofthenodesradio.Choosing

pairprimesisquitechallenging.Let’sconsideraninstanceonhowweconsidertheprimes.For

simplicityconsider2nodes.Letthedesireddutycycleforthenodesbe1%.Thepossibleprime

pairsforthe2nodesareasindicatedinTable3.2.Table3.2:Threedifferentcaseswhentwonodeshavea1%dutycycle.

Case Node1primes Node2primes 1stdiscovery(slotnumber)

1 (211,223) (199,229) 41989thslot

2 (131,383) (139,457) 18209thslot

3 (131,479) (131,487) 131stslot

Incase1,theprime-pairsfornode-1is(211,223)andfornode-2itis(199,229).Further

calculationsontheoverlappingwakeuptimesforthesenodesindicatethatthe1stdiscoveryin

idealscenariohappensattimeslotnumber41989.Incase2,theprime-pairschosenfornode1

andnode2are(131,383)and(139,457)respectively.The1stdiscoverycanhappenmostlikelyif

nocollisionhappensatslotnumber18209.Furthermore,incase3,theprime-pairschosenare

(131,479)and(131,487)fornode1andnode2.Thisindicatesthatthe1stdiscoverycouldhappen

atslot131.Also,ifthe1stneighbordiscoveryfailsincase1andcase2,forthenextdiscoverythe

waittimewouldbelongerwhereasincase3,theneighbordiscoveryhappensmoreoften.

Choosingareciprocalofaprimenumberthatisclosetodutycyclewillensurediscovery.

Thatis,lowdiscoverytimesarepossibleifoneofthereciprocalofprimenumbersisveryclose

tothedesireddutycycle,whiletheotherprimenumberisalargernumber.Hence,it ismore

importanttorandomizethechoiceofprimenumberstoreducethechancethattwonodeshave

thesamepairofprimenumberwhenthedesireddutycycleisthesame.Sinceinournetwork

setupwehavedensityof10nodes,it’simportantweshouldchooseatleast5primesthatare

closetothereciprocalofthedesireddutycycle,andassignthemrandomlytothenodes.This

techniquewillensuremorediscoveriesmorethanthefirsttwopreviousinstances.

10

3.2Experimentalsetup

Inthissection,weprovidetheimplementationdetailsforneighbordiscoveryinmobile

networks. We have simulated and analyzed the results using a network simulator, NS-3 on

networksizesof50nodesand100nodes[3].

Parameters

Table3.3indicatestheparametersconsideredinourexperimentalsetup.Neighborcheck

ishowoftenthenodescheckforthisalreadydiscoveredneighbors.Thispairwiseneighborcheck

isdoneforevery10ms.Slotdurationindicatesthetimeslotthenodeisgoingtobeactiveonce

theirradioisturnedon.Theslotdurationis20ms.Table3.3:Theexperimentparameters.

Typeofparameters Parameters

NeighborCheck 10ms

SlotDuration 20ms

Density(neighborregioncapacity) 10nodes

MobilitySpeed(m/s) 2-43-77-1515-25

Dutycycle(%) 1,10,20,30,50,100

NetworkSize 50,100nodes

Densityofthenetworkindicatesthenumberofneighborsinitsone-hopcommunication

range.Wehaveconsideredittobeupto10nodes.Mobilityspeedindicatesthespeedwithwhich

thenodesmoveinthenetwork.Itisvariedasindicatedinthetable3.3.Dutycycleindicatesthe

activetimeofthenode.Itisvariedbetween1%and100%.100%dutycycleindicatesthenodes

areawakeforentiredurationand1%indicatesitsactivetimeisminimalandissleepingmostof

thetime.Thenetworksizeofthisexperimentsetupwillbeeither50or100nodes.

11

Chapter4

Results

Inthischapter,weanalyzetheresultsofdiscoprotocolon50,and100networksizes.We

haveevaluatedthediscoverylatencyforvaryingdutycycles,mobilityspeedsandnetworksizes

inanetwork.Also,wehavestudiedfailinglatencyforvaryingdutycycles,mobilityspeedsand

networksizes.Theanalysisisbasedonthesimulationresultsobtainedfor10simulations.

4.1DiscoveryLatencyDiscoveryLatencyisafunctionofthenodes’dutycycles,aswellastheneighborcheck

time.

4.1.1DifferentDutyCycles

Inthiscaseweareanalyzingthediscoverylatencybyvaryingthedutycyclekeepingthe

mobilityconstant.Figure4.1–Figure4.4areresultsfornetworksize50nodesandFigure4.5–

Figure4.8areresultsfornetworksize100nodes.Weseetwopatternsinourresults.

1. Discoverylatencyincreasesasthedutycyclevariesfrom1%to10%

Theprimenumberpairchosendoesnotresultindutycycleclosetothedesiredprime

number.Thisisseenwhenthedutycycleis10%.

2. Discoverylatencydecreasesasthedutycyclevariesfrom10%to100%

12

Figure4.1:Thediscoverylatencyfor50nodesnetworkandthemobilityofnodesis2-4m/s.


13



14



15



16

4.1.2DifferentMobilitySpeeds

Inthiscaseweareanalyzingthediscoverylatencybyvaryingthemobilityspeedsofthe

nodekeepingthedutycycleconstant.Figure4.9–Figure4.14areresultsfornetworksize50

nodesandFigure4.15–Figure4.20areresultsfornetworksize100nodes.Weobservethatthe

discoverylatencydecreasesasthemobilityofthenodesincreases.Weseethispatternbecause

whenthenodesaremovingwithslowerspeedtheyremainneighborsforlongertimethanwhen

theymovewithfasterspeed.

In order to ensure this, we have evaluated the percentage of nodes that have been

neighborsbutnotdiscovered.ThisTable4.1showsthatasthemobilityincreasesthepercentage

ofundiscoveredneighbors’increases.

𝑃𝑒𝑟𝑐𝑒𝑛𝑡𝑎𝑔𝑒𝑜𝑓𝑢𝑛𝑑𝑖𝑠𝑐𝑜𝑣𝑒𝑟𝑒𝑑𝑛𝑒𝑖𝑔ℎ𝑏𝑜𝑟𝑠, 𝑃𝑛 = 𝑁45Q

𝑁45Q + 𝑁R∗ 100

where,𝑁45Q->totalnumberofnodesthathavebeenneighborsbutneverdiscovered

𝑁R->totalnumberofnodesthathavebeendiscovered

Table4.1:Percentagesofundiscoveredneighbors’nodesforFigure4.9network.

𝑃4(2-4m/s) 8.568%

𝑃4(3-7m/s) 10.496%

𝑃4(7-15m/s) 12.790%

𝑃4(15-25m/s) 14.247%

17

Figure4.9:Thediscoverylatencyfora50nodesnetworkandnodes’dutycycleis1%.


18



19



20



21



22



23

4.2FailingLatencyFailinglatencyisobservedonlyamongstthenodesthathavebeendiscoveredalreadyandthey

havemovedoutofthecommunicationrangewhentheyhadtoexchangeinformation.

4.2.1DifferentDutyCycles

Inthiscaseweareanalyzingthefailing latencybyvaryingthedutycyclesofthenode

keepingthemobilityconstant.Figure4.21–Figure4.24areresultsfornetworksize50nodesand

Figure4.25–Figure4.29areresults fornetworksize100nodes.Weseetwopatterns inour

results.

1. Failinglatencyslightlyincreasesasthedutycyclevariesfrom1%to10%

Theprimenumberpairchosendoesnotresultindutycycleclosetothedesiredprime

number.Thisisseenwhenthedutycycleis10%.

2. Failinglatencydecreasesasthedutycyclevariesfrom10%to100%significantly

24

Figure4.21:Thefailinglatencyfora50nodesnetworkandthemobilityofnodesis2-4m/s.


25



26



27



28

4.2.2DifferentMobilitySpeeds

Inthiscaseweareanalyzingthefailinglatencybyvaryingthemobilityspeedsofthenode

keepingthedutycycleconstant.Figure4.29–Figure4.34areresultsfornetworksize50nodes.

Weobservethatthefailinglatencyisnotaffectedbychangingthemobilityspeed.

Figure4.29:Thefailinglatencyfora50nodesnetworkandnodes’dutycycleis1%.


29



30



31

Chapter5

FutureWorkandConclusion5.1FutureWork

In this work, we analyzed both discovery and failing latency in mobile networks for

networksizes50and100nodes.Infuture,wewouldliketoanalyzetheresultsfordiscoveryand

failing latency on larger networks (>1000 nodes). Bian et al. [9] presented a comprehensive

surveyaboutmostadvancedneighbordiscoveryprotocols inmobilesensingapplications.The

authors adopted two-level classification. At the higher level, neighbor discovery can be

categorizedintodirectandindirectapproaches.

Directneighbordiscoveryapproachmeanswhenanodediscoversanothernode,thetwo

nodesexchangetheirwakeupschedulesonly.While in indirectneighbordiscoveryapproach,

the technique uses a direct neighbor discovery approach as building blocks and exploit the

collaborationofdirectdiscoveredneighborstodiscovernewneighborsindirectly.Inotherwords,

whentwonodesdiscovereachother,theywillexchangewhattheirlistofnodeswhichhavebeen

discovered.Anextendapproachtomyimplementationsistoenableindirectneighbordiscovery

approach.

5.2Conclusion

After studying Disco; an asynchronous neighbor discovery and rendezvous protocol,

whichallowsnodestooperateatlowdutycycle,yettheydiscovereachotherregardlessofany

prior synchronization information. The Disco’s propose has not been yet tested on large

networks. Itmotivatesme to analyze this protocol on largemobile networks (50 nodes/100

nodes)usinganetworksimulator(NS-3).

32

Neighbordiscoveryhasbeenafundamentalprobleminthesensorsnetworks,wireless

networks,particularly, inmobilewirelessnetworks.ThisworkverifiesthatDiscoprotocolcan

handlelargenetworks.Analyzingbothdiscoveryandfailinglatenciesonthosenetworkswillgive

thenetworkdesigneraclearpicturebasedontheirneeds.

ResultshavebeenevaluatedthatDiscocanachieveenormousnumberofdiscoveriesover

ashortamountoftime(100sec),whilediscoverylatenciesonacertaindutycyclecanvarywith

differentmobilityspeeds;stilltheywereverysatisfying.

33

References

[1] A. Kandhalu, K. Lakshmanan, and R. R. Rajkumar. U-Connect: a low-latency energy-efficientasynchronousneighbordiscoveryprotocol.InProc.ofIPSN,2010.

[2] M. J.McGlynn and S. A. Borbash. Birthday protocols for low energy deployment and flexibleneighbordiscovery inadhocwirelessnetworks. InMobiHoc '01:Proceedingsof the2ndACMInternationalSymposiumonMobileAdhocNetworking&Computing,pages137-145,2001.

[3] "NS-3 Tutorial," [Online]. Available: www.nsnam.org/docs/release/3.18/tutorial/ns-3-tutorial.pdf.

[4] P. Dutta and D. Culler. Practical asynchronous neighbor discovery and rendezvous formobilesensingapplications. InProceedingsofthe6thACMconferenceonEmbeddednetworksensorsystems,pages71–84.ACM,2008.

[5] I.Niven,H.S.Zuckerman,andH.L.Mongomery.AnIntroductiontotheTheoryofNumbers.JohnWiley&Sons,1991.

[6] Y.-C.Tseng,C.-S.Hsu,andT.-Y.Hsieh.Power-savingprotocolsforIEEE802.11-basedmulti-hopadhoc networks. In INFOCOM'02: Proceedings of the 21st Annual Joint Conference of the IEEEComputerandComm.Soc.,2002.

[7] Li, Xiang-Yang, et al. Ad-Hoc, mobile, and wireless network 11th international conference;proceedings.Springer,2012.

[8] V.Kulathumani,A.Arora,M.Sridharan,K.Parker,B.Lemon,"OntherepairtimescalingwallforMANETs"in,2014.

[9] C.Lin,KBian.“Neighbordiscoveryinmobilesensingapplications:Acomprehensivesurvey.”AdHocNetworks,vol.48,2016,pp.39-52.2016.

[10] S. Lai, B. Zhang, B. Ravindran, and H. Cho. CQS-Pair: Cyclic quorum system pair for wakeupchedulinginwirelesssensornetworks.InProc.ofPrinciplesofDistributedSystems,2008.

[11] D.Zhang,T.He,Y.Liu,Y.Gu,F.Ye,R.K.Ganti,andH.Lei.Acc:genericon-demandaccelerationsforneighbordiscoveryinmobileapplications.InProc.ACMSenSys,2012.

[12] R. Zheng, J. C. Hou, and L. Sha. Asynchronouswakeup for ad hoc networks. In Proc. of ACMMobiHoc,2003.

[13] S.Chen,A.Russel,R. Jin,Y.Qin,B.Wang,S.Vasudavan.AsynchronousNeighborDiscoveryonDuty-cycledMobile Devices: Integer andNon-Integer Schedules. In Proc. of ACM June 22-25,2015.

[14] J. Polastre, J. Hill, and D. Culler, “Versatile Low Power Media Access for Wireless SensorNetworks,”Proc.SecondInt’lConf.EmbeddedNetworkedSensorSystems(SenSys’04),pp.95-107.

[15] K. Kumar and P. Kumar, “Tmote Implementation of BMAC and SMAC Protocols,”http://www.cse.iitk.ac.in/users/vkirankr/wireless_report.pdf,2011.

34

[16] J.Hill,R.Szewczyk,A.Woo,S.Hollar,D.E.Culler,andK.S.J.Pister.SystemArchitectureDirectionsfor Networked Sensors. In ASPLOS-IX: Architectural Support for Programming Languages andOperatingSystems,pages93-104,2000.

[17] P.Dutta,D.Culler,andS.Shenker.ProcrastinationMightLeadtoaLongerandMoreUsefulLife.InThe6thWorkshoponHotTopicsinNetworks(HotNetsVI),2007.

[18] A.Kandhalu,K. Lakshmanan,andR.Rajkumar.Neighbordiscovery inmobile sensornetworks.Technicalreport,CarnegieMellonUniversity,2010.

[19] B. Chen, K. Jamieson,H. Balakrishnan, andR.Morris, “Span:An Energy Efficient CoordinationAlgorithm for TopologyMaintenancemAdHocWirelessNetwork,” Proc. of the InternationalConferenceonMobileComputingandNetworking,pp.85-96,2001.

[20] Z.ZhangandB.Li,“Neighbordiscoveryinmobileadhocself-configuringnetworkswithdirectionalantennas:Algorithmsandcomparisons,”IEEETrans.WirelessCommun.,vol.7,no.5,pp.1540–1549,May2008.

[21] S.Vasudevan,D.Towsley,D.Goeckel,andR.Khalili,“Neighbordiscoveryinwirelessnetworksandthecouponcollector’sproblem,”inProc.MobiCom,2009,pp.181–192.

[22] R.Margolies,G.Grebla,T.Chen,D.Rubenstein,andG.Zussman,“Panda:Neighbordiscoveryonapowerharvestingbudget,”IEEEJournalonSelectedAreasinCommunications(JSAC),vol.34,no.12,pp.3606–3619,2016.

[23] W.Zeng,S.Vasudevan,X.Chen,B.Wang,A.Russell,andW.Wei.Neighbordiscoveryinwirelessnetworkswithmultipacketreception.InACMMobiHoc,2011.

[24] M. Bakht, M. Trower, R.H. Kravets. Serachlight: won’t you be my neighbor. In: ProcessingsMobicom.2012.

[25] S.A.Borbash,A.Ephremides,M.J.McGlynn,Anasynchronousneighbordiscoveryalgorithmforwirelesssensornetworks,AdHocNetworks5(7)(2007)998-1016.

[26] P.Zhang,C.M.Sadler,S.A.Lyon,M.Martonosi,Hardwaredesignexperiencesinzebranet,in:ProceedingsSenSys,2004.

Documents

Analyzing discovery latency in mobile networks