在多速率Wi-Fi网络中,争用窗口适应确保通话时间消耗的公平性

O. Tarasyuk, A. Gorbenko, V. Kharchenko, T. Hollstein
{"title":"在多速率Wi-Fi网络中,争用窗口适应确保通话时间消耗的公平性","authors":"O. Tarasyuk, A. Gorbenko, V. Kharchenko, T. Hollstein","doi":"10.1109/DT.2014.6868737","DOIUrl":null,"url":null,"abstract":"In the paper we address a problem of throughput unfairness inherent in the very nature of multirate Wi-Fi networks employing CSMA/CA mechanism. This unfairness exhibits itself through the fact that slow clients consume more airtime to transfer a given amount of data, leaving less airtime for fast clients. The paper introduces analytical models allowing to estimate a fair contention window (CW) size to be used by each station depending on a ratio between station's data rates. Finally, we propose a lightweight distributed algorithm that enables stations to dynamically adapt their CW so that a suboptimal airtime distribution between them is ensured. It prevents network throughput from being dramatically degraded when a slow station is connected to the network.","PeriodicalId":330975,"journal":{"name":"The 10th International Conference on Digital Technologies 2014","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Contention window adaptation to ensure airtime consumption fairness in multirate Wi-Fi networks\",\"authors\":\"O. Tarasyuk, A. Gorbenko, V. Kharchenko, T. Hollstein\",\"doi\":\"10.1109/DT.2014.6868737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper we address a problem of throughput unfairness inherent in the very nature of multirate Wi-Fi networks employing CSMA/CA mechanism. This unfairness exhibits itself through the fact that slow clients consume more airtime to transfer a given amount of data, leaving less airtime for fast clients. The paper introduces analytical models allowing to estimate a fair contention window (CW) size to be used by each station depending on a ratio between station's data rates. Finally, we propose a lightweight distributed algorithm that enables stations to dynamically adapt their CW so that a suboptimal airtime distribution between them is ensured. It prevents network throughput from being dramatically degraded when a slow station is connected to the network.\",\"PeriodicalId\":330975,\"journal\":{\"name\":\"The 10th International Conference on Digital Technologies 2014\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 10th International Conference on Digital Technologies 2014\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DT.2014.6868737\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 10th International Conference on Digital Technologies 2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DT.2014.6868737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在本文中,我们解决了采用CSMA/CA机制的多速率Wi-Fi网络固有的吞吐量不公平问题。这种不公平表现在慢客户端消耗更多的传输时间来传输给定数量的数据,而为快速客户端留下更少的传输时间。本文介绍了分析模型,允许根据站之间的数据速率比率来估计每个站使用的公平竞争窗口(CW)大小。最后,我们提出了一种轻量级的分布式算法,使电台能够动态地调整他们的连续波,从而确保它们之间的次优播出时间分布。当慢站连接到网络时,它可以防止网络吞吐量急剧下降。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Contention window adaptation to ensure airtime consumption fairness in multirate Wi-Fi networks
In the paper we address a problem of throughput unfairness inherent in the very nature of multirate Wi-Fi networks employing CSMA/CA mechanism. This unfairness exhibits itself through the fact that slow clients consume more airtime to transfer a given amount of data, leaving less airtime for fast clients. The paper introduces analytical models allowing to estimate a fair contention window (CW) size to be used by each station depending on a ratio between station's data rates. Finally, we propose a lightweight distributed algorithm that enables stations to dynamically adapt their CW so that a suboptimal airtime distribution between them is ensured. It prevents network throughput from being dramatically degraded when a slow station is connected to the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信