O. Tarasyuk, A. Gorbenko, V. Kharchenko, T. Hollstein
{"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}
引用次数: 11
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.