版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進行舉報或認領(lǐng)
文檔簡介
隨機接入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. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫網(wǎng)僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負責。
- 6. 下載文件中如有侵權(quán)或不適當內(nèi)容,請與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準確性、安全性和完整性, 同時也不承擔用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。
最新文檔
- 廣西工藝美術(shù)研究院有限公司所屬企業(yè)絹麻所2025年12月招聘備考題庫及答案詳解參考
- 門店營銷收費方案(3篇)
- 彩虹上色課件
- 2025年衛(wèi)生健康局招聘備考題庫帶答案詳解
- 聊城大學(xué)東昌學(xué)院《中國近代史綱要》2023-2024學(xué)年第一學(xué)期期末試卷
- 內(nèi)科護理學(xué)護理研究
- 租車行掛靠協(xié)議書
- 幼兒園安全知識培訓(xùn)課件
- 2025年根河市人民政府面向社會公開招聘(補招)鄉(xiāng)鎮(zhèn)及政府專職消防隊員26人備考題庫含答案詳解
- 2025年廣西工藝美術(shù)研究院有限公司所屬企業(yè)廣西絹麻紡織科學(xué)研究所有限公司招聘備考題庫及完整答案詳解一套
- 初二勞技試題及答案上冊
- 員工宿舍分配管理制度
- 話劇社團筆試題及答案解析
- 2025《安全生產(chǎn)法》培訓(xùn)課件
- 網(wǎng)絡(luò)安全意識提升培訓(xùn)課件
- 專業(yè)倫理與職業(yè)素養(yǎng)-計算機、大數(shù)據(jù)與人工智能課件:計算的學(xué)科與職業(yè)
- 《機器人用力觸覺傳感器分級規(guī)范》
- 兒童心理健康教育的實施策略
- 鋼軌探傷鋼軌探傷試塊課件
- 監(jiān)理單位工程項目廉潔教育
- 頸椎病的中醫(yī)診治課件
評論
0/150
提交評論