Performance Analysis of IEEE 80211 Distributed Coordination IEEE 80211分布式协调性能分析.pptVIP

下载本文档

5
0
约6.71千字
约 18页
2018-06-24 发布于四川
举报
版权申诉

Performance Analysis of IEEE 80211 Distributed Coordination IEEE 80211分布式协调性能分析.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Performance Analysis of IEEE 80211 Distributed Coordination IEEE 80211分布式协调性能分析

March 26, 2003 EECS557 course project Performance Analysis of IEEE 802.11 Distributed Coordination Function EECS: 557 Project Presentation 05’ OUTLINE PERFORMANCE MEASURES DCF In the 802.11 protocol, the fundamental mechanism to access the medium is called distributed coordination function (DCF). DCF is based on Carrier Sense Multiple Access with Collision Avoidance( CSMA/CA) with Binary Exponential Back Off Algorithm Basic Access Mechanism – 2 Way Handshaking (ARQ Type- DATA, ACK) RTS/CTS Mechanism – 4 Way Handshaking (RTS, CTS, DATA, ACK) RTS/CTS more useful It reduces the duration of collision when a long packet is transmitted It solves the hidden node problem as done in class Hidden Node just need to know RTS or CTS BACKOFF / CONTENTION WINDOW For the transmission of each packet, a random Backoff time (in slot) is selected uniformly between 0 and CW-1. The value of CW is called contention window. Station also waits for random Backoff Time after successfully transmitting 1 packet to avoid Channel Capture Initial Value of CW = CWmin On Collision: CW is Doubled (Binary Backoff), upto CWmax Successful transmission: CW comes back to CWmin Example: 802.11b uses CWmin = 32, CWmax = 1024 Backoff COUNTER: Initial: Selected randomly between 0 and CW-1 Decrements at each idle slot and “freeze” during a busy slot When Counter hits 0, Station transmits Reset after successful transmission RTS/CTS Mechanism Example CRITICAL ASSUMPTIONS Ideal Channel conditions and finite number of terminals Ideal Channel conditions include (No Hidden Terminals, No Channel Capture) Constant independent collision probability P for each transmitted packet System is in Overload Condition (Every station is always ready to Transmit a Packet) Mathematical Model for Dynamics of DCF State Transition Diagram for the Chain Throughput Analysis Based on Model IMPORTANT RESULTS PERFORMANCE EVALUATION Performance is based on following Parameters Network size n Transmission probability