信道绑定无线局域网中时间公平性的动态A-MPDU自适应方法

Y. Shimizu, Daiki Nobayashi, H. Tamura, K. Tsukamoto
{"title":"信道绑定无线局域网中时间公平性的动态A-MPDU自适应方法","authors":"Y. Shimizu, Daiki Nobayashi, H. Tamura, K. Tsukamoto","doi":"10.1109/PACRIM47961.2019.8985063","DOIUrl":null,"url":null,"abstract":"Channel bonding is a technology to increase the transmission rate by bundling and using multiple continuous channels. However, the communication performance is likely to degrade frequently due to the channel competition caused by the rapid increase of the wireless LAN devices. Dynamic channel bonding is expected to become the mainstream in the future from the viewpoint of efficient channel utilization even under the severe competitive condition. However, since the implementation of the dynamic channel bonding to real PC and simulator is in the preliminary stage, the detailed performance investigation has not been carried out. None of existing studies examines the performance of the dynamic channel bonding at the frame level with CSMA/CA functions under the diverse channel competition condition. In this study, we first examine the performance of the dynamic channel bonding with CSMA/CA functions through theoretical approach (2 M/M/1/K) from the view point of frame level. In addition, we then implement the channel bonding mechanism into the Scenargie simulator and then verify its effectiveness through the comparison between simulation results and theoretical ones. Simulation results show that the dynamic channel bonding is suffering from the performance degradation due to the performance anomaly problem caused by the airtime unfairness, we thus propose a dynamic A-MPDU adaptation method. We showed that our proposed method can maximize throughput while achieving airtime fairness, irrespective of different patterns of channel competition.","PeriodicalId":152556,"journal":{"name":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic A-MPDU adaptation method for airtime fairness in channel bonding-ready WLANs\",\"authors\":\"Y. Shimizu, Daiki Nobayashi, H. Tamura, K. Tsukamoto\",\"doi\":\"10.1109/PACRIM47961.2019.8985063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Channel bonding is a technology to increase the transmission rate by bundling and using multiple continuous channels. However, the communication performance is likely to degrade frequently due to the channel competition caused by the rapid increase of the wireless LAN devices. Dynamic channel bonding is expected to become the mainstream in the future from the viewpoint of efficient channel utilization even under the severe competitive condition. However, since the implementation of the dynamic channel bonding to real PC and simulator is in the preliminary stage, the detailed performance investigation has not been carried out. None of existing studies examines the performance of the dynamic channel bonding at the frame level with CSMA/CA functions under the diverse channel competition condition. In this study, we first examine the performance of the dynamic channel bonding with CSMA/CA functions through theoretical approach (2 M/M/1/K) from the view point of frame level. In addition, we then implement the channel bonding mechanism into the Scenargie simulator and then verify its effectiveness through the comparison between simulation results and theoretical ones. Simulation results show that the dynamic channel bonding is suffering from the performance degradation due to the performance anomaly problem caused by the airtime unfairness, we thus propose a dynamic A-MPDU adaptation method. We showed that our proposed method can maximize throughput while achieving airtime fairness, irrespective of different patterns of channel competition.\",\"PeriodicalId\":152556,\"journal\":{\"name\":\"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM47961.2019.8985063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM47961.2019.8985063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

信道绑定是一种通过捆绑和使用多个连续信道来提高传输速率的技术。然而,由于无线局域网设备数量的迅速增加所带来的信道竞争,使得无线局域网的通信性能有可能频繁下降。即使在激烈的竞争环境下,从有效利用渠道的角度来看,动态渠道绑定也有望成为未来的主流。然而,由于将动态信道绑定到真实PC机和模拟器的实现还处于初步阶段,因此尚未进行详细的性能调查。现有的研究都没有考察在不同信道竞争条件下CSMA/CA函数在帧级的动态信道绑定性能。在本研究中,我们首先从帧级的角度,通过理论方法(2 M/M/1/K)研究了动态信道与CSMA/CA函数键合的性能。此外,我们还在Scenargie模拟器中实现了通道键合机制,并通过仿真结果与理论结果的比较验证了其有效性。仿真结果表明,由于时间不公平导致的性能异常问题导致动态信道绑定性能下降,因此我们提出了一种动态a - mpdu自适应方法。我们表明,我们提出的方法可以最大限度地提高吞吐量,同时实现播出时间公平,而不考虑频道竞争的不同模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic A-MPDU adaptation method for airtime fairness in channel bonding-ready WLANs
Channel bonding is a technology to increase the transmission rate by bundling and using multiple continuous channels. However, the communication performance is likely to degrade frequently due to the channel competition caused by the rapid increase of the wireless LAN devices. Dynamic channel bonding is expected to become the mainstream in the future from the viewpoint of efficient channel utilization even under the severe competitive condition. However, since the implementation of the dynamic channel bonding to real PC and simulator is in the preliminary stage, the detailed performance investigation has not been carried out. None of existing studies examines the performance of the dynamic channel bonding at the frame level with CSMA/CA functions under the diverse channel competition condition. In this study, we first examine the performance of the dynamic channel bonding with CSMA/CA functions through theoretical approach (2 M/M/1/K) from the view point of frame level. In addition, we then implement the channel bonding mechanism into the Scenargie simulator and then verify its effectiveness through the comparison between simulation results and theoretical ones. Simulation results show that the dynamic channel bonding is suffering from the performance degradation due to the performance anomaly problem caused by the airtime unfairness, we thus propose a dynamic A-MPDU adaptation method. We showed that our proposed method can maximize throughput while achieving airtime fairness, irrespective of different patterns of channel competition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信