优化了IEEE 802.11 DCF的避碰算法

Yingxiao Sun, Dewei Yang, Weizhen Tian, Wenlong Liu
{"title":"优化了IEEE 802.11 DCF的避碰算法","authors":"Yingxiao Sun, Dewei Yang, Weizhen Tian, Wenlong Liu","doi":"10.1109/WCSP.2013.6677069","DOIUrl":null,"url":null,"abstract":"IEEE802.11 DCF (Distributed Coordination Function) protocol adopts binary exponential backoff (BEB) algorithm to reduce the probability of collision. However, when the network reaches saturation, throughput declines sharply with the increase of the number of stations (STAs) because of more collisions. In order to further avoid collisions and optimize the system, this paper proposes an improved algorithm based on the RTS / CTS (request to send /dear to send) mechanism. A STA intended to send packet sets an appropriate contention window (CW) and selects a backoff value different from that of other STAs according to the result of previous packet and the current backoff value of other STAs in the network. Theoretical analysis and OPNET simulation results show that the new algorithm outperforms BEB in performance of throughput, network delay and data dropped.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"28 11","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimized backoff algorithm of IEEE 802.11 DCF for collision resolution\",\"authors\":\"Yingxiao Sun, Dewei Yang, Weizhen Tian, Wenlong Liu\",\"doi\":\"10.1109/WCSP.2013.6677069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IEEE802.11 DCF (Distributed Coordination Function) protocol adopts binary exponential backoff (BEB) algorithm to reduce the probability of collision. However, when the network reaches saturation, throughput declines sharply with the increase of the number of stations (STAs) because of more collisions. In order to further avoid collisions and optimize the system, this paper proposes an improved algorithm based on the RTS / CTS (request to send /dear to send) mechanism. A STA intended to send packet sets an appropriate contention window (CW) and selects a backoff value different from that of other STAs according to the result of previous packet and the current backoff value of other STAs in the network. Theoretical analysis and OPNET simulation results show that the new algorithm outperforms BEB in performance of throughput, network delay and data dropped.\",\"PeriodicalId\":342639,\"journal\":{\"name\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"volume\":\"28 11\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2013.6677069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Wireless Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2013.6677069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

IEEE802.11 DCF (Distributed Coordination Function,分布式协调函数)协议采用了二进制指数回退(binary exponential backoff, BEB)算法来降低碰撞的概率。然而,当网络达到饱和时,由于冲突的增加,吞吐量随着站数的增加而急剧下降。为了进一步避免碰撞,优化系统,本文提出了一种基于RTS / CTS (request to send /dear to send)机制的改进算法。发送报文的STA根据前一个报文的处理结果和网络中其他STA当前的回退值,设置一个合适的竞争窗口(CW),选择一个不同于其他STA的回退值。理论分析和OPNET仿真结果表明,新算法在吞吐量、网络延迟和数据丢失等性能上都优于BEB算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized backoff algorithm of IEEE 802.11 DCF for collision resolution
IEEE802.11 DCF (Distributed Coordination Function) protocol adopts binary exponential backoff (BEB) algorithm to reduce the probability of collision. However, when the network reaches saturation, throughput declines sharply with the increase of the number of stations (STAs) because of more collisions. In order to further avoid collisions and optimize the system, this paper proposes an improved algorithm based on the RTS / CTS (request to send /dear to send) mechanism. A STA intended to send packet sets an appropriate contention window (CW) and selects a backoff value different from that of other STAs according to the result of previous packet and the current backoff value of other STAs in the network. Theoretical analysis and OPNET simulation results show that the new algorithm outperforms BEB in performance of throughput, network delay and data dropped.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信