TY - GEN
T1 - Moving away from the Crowd
T2 - 32nd Annual ACM Symposium on Applied Computing, SAC 2017
AU - Kulkarni, Parag
AU - Zhong, Zhenzhe
AU - Cao, Fengming
N1 - Publisher Copyright:
Copyright 2017 ACM.
PY - 2017/4/3
Y1 - 2017/4/3
N2 - 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.
AB - 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.
KW - Channel selection
KW - Dense wireless LANs
KW - IEEE 802.11
KW - WiFi
UR - http://www.scopus.com/inward/record.url?scp=85020902359&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85020902359&partnerID=8YFLogxK
U2 - 10.1145/3019612.3019771
DO - 10.1145/3019612.3019771
M3 - Conference contribution
AN - SCOPUS:85020902359
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 628
EP - 633
BT - 32nd Annual ACM Symposium on Applied Computing, SAC 2017
PB - Association for Computing Machinery
Y2 - 4 April 2017 through 6 April 2017
ER -