計(jì)算機(jī)網(wǎng)絡(luò)英文版課件:5-4 隨機(jī)接入MAC協(xié)議_第1頁(yè)
計(jì)算機(jī)網(wǎng)絡(luò)英文版課件:5-4 隨機(jī)接入MAC協(xié)議_第2頁(yè)
計(jì)算機(jī)網(wǎng)絡(luò)英文版課件:5-4 隨機(jī)接入MAC協(xié)議_第3頁(yè)
計(jì)算機(jī)網(wǎng)絡(luò)英文版課件:5-4 隨機(jī)接入MAC協(xié)議_第4頁(yè)
計(jì)算機(jī)網(wǎng)絡(luò)英文版課件:5-4 隨機(jī)接入MAC協(xié)議_第5頁(yè)
已閱讀5頁(yè),還剩14頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶(hù)提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

隨機(jī)接入MAC協(xié)議MACProtocols:ataxonomyThreebroadclasses:ChannelPartitioningdividechannelintosmaller“pieces”(timeslots,frequency,code)allocatepiecetonodeforexclusiveuseRandomAccesschannelnotdivided,allowcollisions“recover”fromcollisions“Takingturns”nodestaketurns,butnodeswithmoretosendcantakelongerturnsRandomAccessProtocolsWhennodehaspackettosendtransmitatfullchanneldatarateR.noaprioricoordinationamongnodestwoormoretransmittingnodes?“collision”,randomaccessMACprotocolspecifies:howtodetectcollisionshowtorecoverfromcollisions(e.g.,viadelayedretransmissions)ExamplesofrandomaccessMACprotocols:slottedALOHAALOHACSMA,CSMA/CD,CSMA/CASlottedALOHAAssumptions:allframessamesizetimedividedintoequalsizeslots(timetotransmit1frame)nodesstarttotransmitonlyslotbeginningnodesaresynchronizedif2ormorenodestransmitinslot,allnodesdetectcollisionOperation:whennodeobtainsfreshframe,transmitsinnextslotifnocollision:nodecansendnewframeinnextslotifcollision:noderetransmitsframeineachsubsequentslotwithprob.puntilsuccessSlottedALOHAProssingleactivenodecancontinuouslytransmitatfullrateofchannelhighlydecentralized:onlyslotsinnodesneedtobeinsyncsimpleConscollisions,wastingslotsidleslotsnodesmaybeabletodetectcollisioninlessthantimetotransmitpacketclocksynchronizationSlottedAlohaefficiencysuppose:Nnodeswithmanyframestosend,eachtransmitsinslotwithprobabilitypprobthatgivennodehassuccessinaslot=p(1-p)N-1probthatanynodehasasuccess=Np(1-p)N-1maxefficiency:findp*thatmaximizes

Np(1-p)N-1formanynodes,takelimitofNp*(1-p*)N-1asNgoestoinfinity,gives:Maxefficiency=1/e=.37Efficiency:long-run

fractionofsuccessfulslots

(manynodes,allwithmanyframestosend)Atbest:

channelusedforusefultransmissions37%oftime!!Pure(unslotted)ALOHAunslottedAloha:simpler,nosynchronizationwhenframefirstarrivestransmitimmediatelycollisionprobabilityincreases:framesentatt0collideswithotherframessentin[t0-1,t0+1]PureAlohaefficiencyP(successbygivennode)=P(nodetransmits).P(noothernodetransmitsin[p0-1,p0].P(noothernodetransmitsin[p0-1,p0]=p.(1-p)N-1.(1-p)N-1=p.(1-p)2(N-1)

…choosingoptimumpandthenlettingn->infty...

=1/(2e)=.18

evenworsethanslottedAloha!PureALOHAThroughputversusofferedtrafficforALOHAsystems.CSMA(CarrierSenseMultipleAccess)CSMA:listenbeforetransmit:Ifchannelsensedidle:transmitentireframeIfchannelsensedbusy,defertransmissionhumananalogy:don’tinterruptothers!CSMAcollisionscollisionscanstilloccur:propagationdelaymeanstwonodesmaynotheareachother’stransmissioncollision:entirepackettransmissiontimewastednote:roleofdistance&propagationdelayindeterminingcollisionprobabilityNonpersistentCSMAIfmediumisidle,transmit;otherwise,goto2Ifmediumisbusy,waitamountoftimedrawnfromprobabilitydistribution(retransmissiondelay)andrepeat1

RandomdelaysreducesprobabilityofcollisionsConsidertwostationsbecomereadytotransmitatsametimeWhileanothertransmissionisinprogressIfbothstationsdelaysametimebeforeretrying,bothwillattempttotransmitatsametimeCapacityiswastedbecausemediumwillremainidlefollowingendoftransmissionEvenifoneormorestationswaitingNonpersistentstationsdeferential1-persistentCSMAToavoididlechanneltime,1-persistentprotocolusedStationwishingtotransmitlistensandobeysfollowing:

Ifmediumidle,transmit;otherwise,gotostep2Ifmediumbusy,listenuntilidle;thentransmitimmediately1-persistentstationsselfishIftwoormorestationswaiting,collisionguaranteedGetssortedoutaftercollisionP-persistentCSMACompromisethatattemptstoreducecollisionsLikenonpersistentAndreduceidletimeLike1-persistentRules:Ifmediumidle,transmitwithprobabilityp,anddelayonetimeunitwithprobability(1–p)TimeunittypicallymaximumpropagationdelayIfmediumbusy,listenuntilidleandrepeatstep1Iftransmissionisdelayedonetimeunit,repeatstep1Whatisaneffectivevalueofp?PersistentandNonpersistentCSMAComparisonofthechannelutilizationversusloadforvariousrandomaccessprotocols.CSMA/CD(CollisionDetection)CSMA/CD:carriersensing,deferralasinCSMAcollisionsdetectedwithinshorttimecollidingtransmissionsaborted,reducingchannelwastagecollisiondetection:easyinwiredLANs:measuresignalstrengths,comparetransmitted,receivedsignalsdifficultinwirelessLANs:receivedsignalstrengthoverwhelmedbylocaltransmissionstrengthhumananalogy:thepoliteconversationalistCSMA/CDcollisiondetectionCSMA/CD(CollisionDetection)WithCSMA,collisionoccupiesmediumfordurationoftr

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

評(píng)論

0/150

提交評(píng)論