已阅读5页,还剩107页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
JieWuDepartmentofComputerandInformationSciencesTempleUniversityPhiladelphia,PA19122,CIS9590AdHocNetworks(PartII),TableofContents,IntroductionInfrastructurednetworksHandofflocationmanagement(mobileIP)channelassignment,TableofContents(contd.),InfrastructurelessnetworksWirelessMAC(IEEE802.11andBluetooth)AdHocRoutingProtocolsMulticastingandBroadcastingSecurityNetworkCoding,TableofContents(contd.),Infrastructurelessnetworks(contd.)PowerOptimizationApplicationsSensornetworksandindoorwirelessenvironmentsPervasivecomputingSocialnetworksSampleon-goingprojects,AdHocWirelessNetworks(Infrastructurelessnetworks),Anadhocnetworkisacollectionofwirelessmobilehostformingatemporarynetworkwithouttheaidofanycentralizedadministrationorstandardsupportservicesregularlyavailableonthewideareanetworktowhichthehostsmaynormallybeconnected(JohnsonandMaltz),AdHocWirelessNetworks(Infrastructurelessnetworks),Manet(mobileadhocnetworks)MobiledistributedmultihopwirelessnetworksTemporaryinnatureNobasestationandrapidlydeployableNeighborhoodawarenessMultiple-hopcommunicationUnitdiskgraph:hostconnectionbasedongeographicaldistance,SampleAdHocNetworks,SensornetworksIndoorwirelessapplicationsMeshnetworksPeople-basednetworks“smallworld”thatareverylargegraphsthattendtobesparse,clustered,andhaveasmalldiameter.“sixdegreeofseparation”,Self-organizing:withoutcentralizedcontrolScarceresources:bandwidthandbatteriesDynamicnetworktopology,Characteristics,UnitDiskGraph,Figure1:Asimpleadhocwirelessnetworkoffivewirelessmobilehosts.,Defenseindustry(battlefield)LawenforcementAcademicinstitutions(conferenceandmeeting)PersonalareanetworksandBluetoothHomenetworkingEmbeddingcomputingapplicationsHealthfacilitiesDisasterrecovery(search-and-rescue),Applications,Applications,MobilitymanagementAddressingandrouting*LocationtrackingAbsolutevs.Relative,GPSNetworkmanagementMergeandsplitResourcemanagementNetworksresourceallocationandenergyefficiencyQoSmanagement*Dynamicadvancereservationandadaptiveerrorcontroltechniques,MajorIssues,MACprotocols*Contentionvs.contention-freeApplicationsandmiddlewareMeasurementandexperimentationSecurity*Authentication,encryption,anonymity,andintrusiondetectionErrorcontrolandfailureErrorcorrectionandretransmission,deploymentofback-upsystemsNetworkcodingReducenumberoftransmissions,MajorIssues(Contd.),IssuestobeCovered,WirelessMediaAccessProtocols(MAC)AdHocRoutingProtocolsMulticastingandBroadcastingPowerOptimizationSecurityNetworkCoding,WirelessMAC,AMAC(MediaAccessProtocol)isasetofrulesorprocedurestoallowtheefficientuseofasharedmedium.Contentionvs.contention-freeSender-initiatedvs.receiver-initiated,WirelessMAC:MajorIssues,DistributedoperationsSynchronizationHiddenterminalsExposedterminalsThroughputAccessdelayFairness,Real-timetrafficResourcereservationAbilitytomeasureresourceavailabilityPowerandratecontrolDirectionalantennas,WirelessMAC,Contention-basedALOHA:nocollisionavoidancePure:transmittedatarbitrarytimeSlotted:transmittedatstartofatimeslotp-persistent:slottedandtransmittedwithaprobabilityp,WirelessMAC,CarrierSenseMultipleAccess(CSMA):listentodeterminewhetherthereisactivityonthechannelPersistent:continuouslylistensNonpersistent:waitsarandomamountoftimebeforere-testingp-persistent:slottedandtransmitwhenidlewithaprobabilityofp,WirelessMAC,Contention-freeprotocolsBit-mapprotocol:eachcontentionperiodconsistsofNslots.Binarycountdown:usebinarystationaddressinbidding.HybridMixedcontention-freewithcontention,WirelessMAC,HiddenTerminalProblemTwonodes,hiddenfromoneanother(outoftransmissionrange),attempttosendinformationtothesamereceivingnode.Packetcollisions.ExposedNodeProblemAnodeisinhibitedfromtransmittingtoothernodesonoverhearingapackettransmission.Wastedbandwidth.,WirelessMAC,Sender-initiatedMACA(MultipleAccesswithCollisionAvoidance)(RTS-CTS-data)MACAW(MACAwithAcknowledgement)BTMA(BusyToneMultipleAccess)DBTMA(DualBTMA)Receiver-initiatedMACA-BI(ByInvitation)OtherextensionsMarchandPAMAS,MACA(P.Khan),Nocarrier-sensingforchannelTwospecialsignalsRTS:request-to-sendCTS:clear-to-sendPacketlostBinaryexponentialback-upOvercomesthehiddenterminalissue,Samplecollision,RTS-CTSproblem1,Samplecollision,RTS-CSTproblem2,MACAW(S.ShenkerandL.Zhang),RTS+CTS+DS+DATA+ACKDS:data-sending(avoidunnecessaryback-offcounterbuildup)RRTS:request-for-request-to-sendDistinctback-offcounterperflow,DBTMA(Z.Haas),BTMA(BusyToneMultipleAccess)Separatecontrolanddata(busytone)NodessensedatacarryalsosendbusytoneToorestrictive(Disabletwo-hopneighbors)DualBTMARTSReceivebusytone+CTSTransmitbusytone+Data,MACA-BI(M.Gerla),Receiver-initiatedRTR:ready-to-receiveData:datatransmission,MARCH(C.T.Toh),MediaAccesswithReducedHandshake(MARCH),PAMAS(C.S.Raghavendra),Power-AwareMulti-AccessProtocolwithSignaling(PAMAS)Temp.reducingtransmitterrangeTurnoff,Others(N.H.Vaidya),DifferentrangesTR:transmissionrange,IR:interferencerange,SR:sensingrange(TRIRSR)DifferentrangesforRTS,CTS,Data,andAckDirectionalantennasDO(sender:omni(O)andreceiver:directional(D)Othermodels:OO,OD,andDD,Others(M.Fang),ImpactofMAConcommunicationIntra-flowcontentionInter-flowcontentionPhysicallayerrelatedissuesRate-adaptation(varyingthedatarate)Otheroptions:varyingthetransmissionpowerorthepacketlengthLinkDiversity:Multi-outputlinkdiversityandmulti-inputlinkdiversity,PowerSaving(Y.C.Tseng),TsengsPower-savingProtocols:UseperiodicactivewindowtodiscoverneighborsOverlappingAwakeIntervalsWake-upPrediction,PowerSaving,Dominating-Awake-IntervalProtocol,PowerSaving,Periodically-Fully-Awake-Interval,PowerSaving,Quorum-BasedProtocols,IEEE802.11,TwooperationalmodesInfrastructure-basedInfrastructurelessoradhocTwotypesofserviceattheMAClayerContention-freeservicebyDistributedCoordinationFunction:DCFContention-freeservicebyPointCoordinationFunction:PCF,IEEE802.11,TwooperationalmodesInfrastructure-basedInfrastructurelessoradhocTwotypesofserviceattheMAClayerContention-freeservicebyDistributedCoordinationFunction:DCFContention-freeservicebyPointCoordinationFunction:PCF,IEEE802-11,RTS-CTShandshake,IEEE802.11,RTS-CTShandshakeRTS(requesttosend)CTS(cleartosend)DatatrasmissionAckOtheritemsNetworkAllocationVector(NAV)DistributedInterFrameSpace(DIFS)ShortInterFrameSpace(SIFS)Backofftime,IEEE802.11,RTS-CTS:contentionDatatransmissionLcontention-freeNAVsetupcannotworkproperlywhentherearecollisionsAllpackets:RTS,CTS,Data,AckaresubjecttocollisionsSIFSDIFStoincreasethepriorityBackofftime:anintegerfrom(0,CW-1),whereCW(contentionwindow)isdoubledateachretransmission,RoutinginAdHocNetworks,Types:(n:networksize)Unicasting:(1,1)=(source,destination)Multicasting:(1,k),1knBroadcasting:(1,n)Geocasting:(1,kinaregion)Gossip:(n,n)Gathering:(k,1)Fusion:aspecialtypeofgathering(withsimpledataprocessingatintermediatenodes),RoutinginAdHocNetworks,Qualitativeproperties:DistributedoperationLoop-freedomDemand-basedoperationProactiveoperationSecuritySleepperiodoperationUnidirectionallinksupport,RoutinginAdHocNetworks,Quantitativemetrics:End-to-enddatathroughputanddelayRouteacquisitiontimePercentageout-of-orderdeliveryEfficiency,BasicRoutingStrategiesinInternet,SourceRoutingvs.DistributedRouting,Figure2:Asamplesourcerouting,Figure3:Asampledistributedrouting,Classification,Proactivevs.reactiveproactive:continuouslyevaluatenetworkconnectivityreactive:invokearoutedeterminationprocedureon-demand.RightbalancebetweenproactiveandreactiveFlatvs.hierarchical,SampleProtocols,ProactiveProtocolsDestinationsequenceddistancevector(DSDV)ReactiveProtocolsDynamicsourcerouting(DSR)Adhocon-demanddistancevectorrouting(AODV)Temporallyorderedroutingalgorithms(TORA),SampleProtocols,Hybrid:ZoneroutingHierarchicalCluster-basedConnected-dominating-set-based,Proactive:DSDV,BasedonBellman-FordroutingalgorithmsEnhancedwithfreedomfromloops.Enhancedwithdifferentiationofstaleroutesfromnewonesbysequencenumbers.,Reactive,ThreestepsRoutediscoveryDataforwardingRoutemaintenance,DSR,Therearenoperiodicroutingadvertisementmessages(therebyreducingnetworkbandwidthoverhead).Eachhostmaintainsaroutecache:sourceroutesthatithaslearned.Ifarouteisnotfoundfromroutecache,thesourceattemptstodiscoveroneusingroutediscovery.Routemaintenancemonitorsthecorrectoperationofarouteinuse.,DSRRouting(Contd.),AsampleDSRroutediscovery,AODV,CombinationofDSRandDSDVRoutingtableisconstructedondemand.Sequencenumbers(issuedfromdifferentdestinations)areusedtoavoidloopingThenodeshouldrespond(ROUTE_REPLY)arequest(ROUTE_REQ)ifItisthedestinationnodeAnintermediatenodewitharouteofadestinationsequencenumbernolessthanthatintherequestpacket.,TORA,Foreachdestination,aDAGismaintainedwithdestinationasthesink:Eachnodehasaheightmetric.Adirectedlinkalwayspointstoanodewithalowerheightmetric.Tosendapacket,ahostforwardsthepackettoanyneighborwithalowermetric.,Proactive:DataForwarding,Sourcerouting:centralizedatthesourceDistributedrouting:decentralizedMultiplepaths,Proactive:RouteMaintenance,Sourceroutingvs.distributedrouting.Globalre-constructionvs.localfixSinglepathvs.multiplepath,TORA:routemaintenance,FullreversalAteachiterationeachnodeotherthanthedestinationthathasnooutgoinglinkreversesthedirectionsofallitsincominglinks.PartialreversalEverynodeuotherthanthedestinationkeepsalistofitsneighboringnodesvthathavereversedthedirectionofthecorrespondinglink(u,v)Ateachiterationeachnodeuthathasnooutgoinglinkreversesthedirectionsofthelinks(u;v)forallvwhichdonotappearonitslist,andemptiesthelist.Ifnosuchvexists,nodeureversesthedirectionsofallincominglinksandemptiesthelist.,TORA:routemaintenance,Trade-offs:networkcapacityusageinproactiveapproachesandthelongdelayinreactiveapproaches.Aroutingzone(forahost)includesthenodeswithinagivennumberofhops.Eachhostmaintainsroutinginformationonlytonodeswithinitsroutingzone.Informationoutsidetheroutingzoneisobtainedthroughondemand.,Hybrid:Zone-basedRouting,Zone-basedRouting(Contd.),Figure5:Zonerouting,Hiearchical:Domination-set-based,Schoolbusrouting,Graph-theoreticDefinition,AsetinG(V,E)isdominatingifallthenodesinthesystemareeitherinthesetorneighborsofnodesintheset.,Five-QueenProblem(1850s),DesirableFeatures,SimpleandquickConnecteddominatingset,Figure6:Asimpleadhocwirelessnetworkoffivewirelessmobilehosts.,ExistingApproaches,Graphtheorycommunity:Boundsonthedominationnumber(Haynes,Hedetniemi,andSlater,1998).Specialclassesofgraphforwhichthedominationproblemcanbesolvedinpolynomialtime.,ExistingApproaches(Contd.),Adhocwirelessnetworkcommunity:Global:MCDS(Sivakumar,Das,andBharghavan,1998).Quasi-global:spanning-tree-based(Wan,Alzoubi,andFrieder,2002).Quasi-local:cluster-based(LinandGerla,1999).Local:markingprocess(WuandLi,1999).,MCDS(Sivakumar,Das,andBharghavan,UIUC),Allnodesareinitiallycoloredwhite.Thenodewiththemaximumnodedegreeisselectedastherootandcoloredblack.Alltheneighborsoftherootarecoloredgray.Selectagraynodethathasthemaximumwhiteneighbors.Thegraynodeiscoloredblackanditswhiteneighborsaremarkedgray.Repeatstep(3)untilthereisnomorewhitenode.,MCDS(Contd.),blacknodes=CDS(connecteddominatingset),Figure7:MCDSasanapproximationofCDS,Spanning-tree-based(Wan,Alzoubi,andFrieder,IIT),Aspanningtreerootedatv(selectedthroughanelectionprocess)isfirstconstructed.Nodesarelabeledaccordingtoatopologicalsortingorderofthetree.,Spanning-tree-based(Contd.),Nodesaremarkedbasedontheirpositionsintheorderstartingfromrootv.Allnodesarewhiteinitially.Vismarkedblackandallnodesarelabeledblackunlessthereisablackneighbor.Eachblacknode(exceptrootv)selectsaneighborwiththelargestlabelbutsmallerthanitsownlabelandmarkitgray.,Spanning-tree-based(Contd.),blacknodes=DSblacknodes+graynodes=CDS,Figure8:selectingCDSinaspanningtree,Cluster-based(LeeandGerla,UCLA),Allnodesareinitiallywhite.Whenawhitenodefindsitselfhavingthelowestidamongallitswhiteneighbors,itbecomesaclusterheadandcolorsitselfblack.Allitsneighborsjoinintheclusterandchangetheircolorstogray.,Cluster-based(Contd.),Repeatsteps(1)and(2)untilthereisnowhitenodeleft.Specialgraynodes:graynodesthathavetwoneighborsindifferentclusters.,Cluster-based(Contd.),blacknodes=DSblacknodes+specialgraynodes=CDS,Figure9:sequentialpropagationinthecluster-basedapproach.,LocalizedAlgorithms,Processors(hosts)onlyinteractwithothersinarestrictedvicinity.Eachprocessorperformsexceedinglysimpletasks(suchasmaintainingandpropagatinginformationmarkers).Collectivelytheseprocessorsachieveadesiredglobalobjective.Thereisnosequentialpropagationofinformation.,MarkingProcess(WuandLi,1999),Anodeismarkedtrueifithastwounconnectedneighbors.Asetofmarkednodes(gatewaysnodes)Vformaconnecteddominatingset.,MarkingProcess(Contd.),Figure10:Asampleadhocwirelessnetwork,Dominating-set-basedRouting,Ifthesourceisnotagatewayhost,itforwardspacketstoasourcegatewayneighbor.Thissourcegatewayactsasanewsourcetoroutepacketsintheinducedgraphgeneratedfromtheconnecteddominatingset.Eventually,packetsreachadestinationgateway,whichiseitherthedestinationhostitselforagatewayofthedestinationhost.,DominatingSetReduction,Reducethesizeofthedominatingset.Roleofgateway/non-gatewayisrotated.,DominatingSetReduction(Contd.),Nv=N(v)UvisaclosedneighborsetofvRule1:IfNvNuinGandid(v)id(u),thenunmarkv.Rule2:IfN(v)N(u)UN(w)inGandid(v)=minid(v),id(u),id(w),thenunmarkv.,DominatingSetReduction(Contd.),Figure12:twosampleexamples,Example,Figure13:(a)Dominatingsetfromthemarkingprocess(b)Dominatingsetafterdominatingsetreduction,DirectedNetworks:dominatingnodeandabsorbantnode,Figure15:Dominatingandabsorbantnodes,DirectedNetworks(Contd.),Findingasubsetthatisbothdominatingandabsorbant(Wu,IEEETPDS2002).,Figure16:Anabsorbantsetandadominatingset,MobilityManagement,Update/re-calculationon/offmovementrecognizinganewlinkrecognizingabrokenlinkLocalizedmaintenance(update),QoSrouting,Wirelesslinksbandwidthmaybeaffectedbythetransmissionactivitiesofadjacentlinks.Unlikeone-hopnetwork(cellular),onemustguaranteethequalityofmultiplehopsinapath.Existinglinksmaydisappearandnewlinksmaybeformedasmobilehostsmove.,QoS:Signalstability-basedadaptive(SSA),Eachnodemaintainsasignalstabilitytable.AreceivingnodepropagatesarequestifTherequestisreceivedoverastronglink.TherequesthanotbeenforwardedpreviouslyThelevelofqualifycanbeloweredatthesourceifthesourcefailtoreceiveareplywithinatime-outperiod.,QoS:Ticket-basedrouting,Eachprobingpacketcarriesanumberoftickets.Thenumberofroute-searchingpacketsisconfinedtoavoidblindflooding.,Hierarchicalroutingprotocols,Hierarchicalstaterouting(HSR)Multi-levelclusteringAnodecanbeaheadatdifferentlevels,Hierarchicalroutingprotocols,Zone-basedRoutingProtocol(ZRP)Proactiveintra-zoneandreactiveinter-zone.FisheyeStateRoutingProtocol(FSR)Afishseyethatcancapturepixelinformationwithgreateraccuracynearitsevesfocalpoint.Thefrequencyofexchangesdecreaseswithanincreaseinscope.,GeometricRouting,GPS-basedroutingThespaceispartitionedintoa2dgridOneclusterheadisselectedineachgridpoint.SparseagraphGabrielgraph:linkuvexistsifftheopendiskwithdiameteruvcontainsnoothernodes.RNG(relativeneighborhoodgraph):linkexistsifd(u,v)d(u,w)andd(u,v)d(v,w).Yaograph:Foreachnodeu,anyk(k6)equal-separatedraysoriginatedatudefinekcones.Ineachcone,choosetheclosetv(ifany)withinthetransmitterrangeofuandaddadirectedlink(u,v).,Samples,GeometricRouting,GreedyalgorithmClosertothedestinationDifferentgreedy:mostforwardingprogresswithinradiusFaceroutingRouteonafaceinGabrielgraphAlternatebetweenright-handandleft-handruleatintersection(ofthelineconnectedsourceanddest.)Greedy-Face-GreedyGFGonCDS,Sample,CollectiveCommunication,Broadcast:onesourceandalldestinations.Multicast:onesourceandmanydestinations.,Broadcast:BlindFlooding,Redundanttransmissionmaycausecontentionandcollision,Broadcast,Staticvs.dynamicForwardingstatusdeterminedbeforeorafterthebroadcastprocess)Self-pruningvs.neighbor-designatingForwardingstatusdeterminesbyeachnodeitselforbyneighbors.,Broadcast,Connected-dominating-set-basedOnlydominatingnodesforwardthebroadcastpacket.Cluster-based(independentset)Onlyclusterheadsforwardthepacket,somegateways(thatconnecttwoadjacentclusters)areselectedtorelaythepacket.,Broadcast,Dominantpruning(multipointrelays)Selectasubsetof1-hopneighbortocoverall2-hopneighbors,Broadcast,Agenericrule:Nodevhasanon-forwardingstatusifanytwoneighborsareconnectedbyapathconsistsofvisitednodesandnodeswithahigherpriorities.,Multicast,Source-initiatedprotocolsJoinReqandJoinReplyReceiver-initiatedprotocolsJoinReqandJoinAckTree-basedvs.mesh-basedSoft-statevs.hard-state,Multicast,Shortestpathtree:foraparticularmulticastCoretree:sharedtreeforallmulticast,Multicasting:ODMRP,On-demandmulticastroutingprotocol,Multicasting:MulticastAODV,DealingwithMobility,NodemobilityisconsideredtobeundesirableinMANETsusingac
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2025中国核工业集团四〇四厂区招聘70人笔试模拟试卷带答案解析
- 2026江西银行引培生招聘备考公基题库带答案解析
- 2025年永吉县总工会公开招聘工会社会工作者(6人)历年真题库附答案解析
- 2025中国人民人寿保险股份有限公司锡林郭勒中心支公司招聘5人笔试备考试卷带答案解析
- 2025福建福州市罗源县城市管理和综合执法局执法辅助人员招聘备考题库带答案解析
- 2025天津银行资产负债管理部总经理或副总经理招聘1人历年真题库附答案解析
- 乳山船舶买卖合同
- 楼面防水隔热工程合同
- 大型冷库维保合同
- 灯光音响检测合同
- GB/T 36198-2018土壤质量土壤气体采样指南
- GB/T 11361-2008同步带传动梯形齿带轮
- 马工程《教育学原理》课后习题讲解
- 《国际贸易实务》全套课件【教学】
- 公益事业捐赠预评估表
- 江苏开放大学组织行为学期末复习题
- 《未成年人保护法》专题测试题附答案
- 科学社会学的研究对象
- 工程会议签到表
- 去极端化学习材料课件
- 中国文化概论(第三版)全套课件
评论
0/150
提交评论