Moving away from the crowd: channel selection in uncoordinated unplanned dense wireless LANs

P. Kulkarni, Zhenzhe Zhong, Fengming Cao
{"title":"Moving away from the crowd: channel selection in uncoordinated unplanned dense wireless LANs","authors":"P. Kulkarni, Zhenzhe Zhong, Fengming Cao","doi":"10.1145/3019612.3019771","DOIUrl":null,"url":null,"abstract":"Networks using WiFi continue to proliferate which has contributed to increased levels of crowding in the unlicensed bands in which these networks operate. Given the limited number of channels available in these bands, a key problem that arises is how to avoid / minimise conflicting channel assignment among neighbouring networks. This is particularly challenging in uncoordinated, unplanned deployments wherein Access Points (APs) belonging to different administrative entities may be operating in isolation in the vicinity of each other. Given the difficulty of planning conflict free channel allocation in such deployments, it is highly desirable to devise mechanisms such that the APs themselves become radio neighbourhood aware and adapt their operation (channel switching on the fly) so as to mitigate interference issues. In this paper, we propose two distributed channel selection algorithms for accomplishing the above mentioned objective. In particular, we show that these algorithms are practical from an implementation perspective, accomplish their objective without requiring any changes to the hardware, the existing infrastructure and the WLAN standard, and highlight findings from a simulation based study. Findings indicate that the proposed algorithms significantly outperform the typical random selection approach commonly employed by low cost commercial off-the-shelf hardware.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3019771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Networks using WiFi continue to proliferate which has contributed to increased levels of crowding in the unlicensed bands in which these networks operate. Given the limited number of channels available in these bands, a key problem that arises is how to avoid / minimise conflicting channel assignment among neighbouring networks. This is particularly challenging in uncoordinated, unplanned deployments wherein Access Points (APs) belonging to different administrative entities may be operating in isolation in the vicinity of each other. Given the difficulty of planning conflict free channel allocation in such deployments, it is highly desirable to devise mechanisms such that the APs themselves become radio neighbourhood aware and adapt their operation (channel switching on the fly) so as to mitigate interference issues. In this paper, we propose two distributed channel selection algorithms for accomplishing the above mentioned objective. In particular, we show that these algorithms are practical from an implementation perspective, accomplish their objective without requiring any changes to the hardware, the existing infrastructure and the WLAN standard, and highlight findings from a simulation based study. Findings indicate that the proposed algorithms significantly outperform the typical random selection approach commonly employed by low cost commercial off-the-shelf hardware.
远离人群:非协调非规划密集无线局域网中的信道选择
使用WiFi的网络继续激增,这导致这些网络运行的无证频段越来越拥挤。鉴于这些频带中可用的信道数量有限,出现的一个关键问题是如何避免/最小化相邻网络之间的冲突信道分配。这在未经协调和计划外的部署中尤其具有挑战性,因为属于不同管理实体的接入点可能在彼此附近孤立地运行。考虑到在这种部署中规划无冲突信道分配的困难,设计这样的机制是非常可取的,即ap本身成为无线电邻居感知并调整其操作(动态切换信道)以减轻干扰问题。在本文中,我们提出了两种分布式信道选择算法来实现上述目标。特别地,我们展示了这些算法从实现的角度来看是实用的,在不需要对硬件、现有基础设施和WLAN标准进行任何更改的情况下实现其目标,并强调了基于仿真的研究结果。研究结果表明,所提出的算法明显优于低成本商用现成硬件通常采用的典型随机选择方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信