{"title":"远离人群:非协调非规划密集无线局域网中的信道选择","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":"{\"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}","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}
Moving away from the crowd: channel selection in uncoordinated unplanned dense wireless LANs
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.