Weighted coloring based channel assignment for WLANs
Top Cited Papers
- 1 July 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOBILE Mobile Computing and Communications Review
- Vol. 9 (3) , 19-31
- https://doi.org/10.1145/1094549.1094554
Abstract
We propose techniques to improve the usage of wireless spectrum in the context of wireless local area networks (WLANs) using new channel assignment methods among interfering Access Points (APs). We identify new ways of channel re-use that are based on realistic interference scenarios in WLAN environments. We formulate a weighted variant of the graph coloring problem that takes into account realistic channel interference observed in wireless environments, as well as the impact of such interference on wireless users. We prove that the weighted graph coloring problem is NP-hard and propose scalable distributed algorithms that achieve significantly better performance than existing techniques for channel assignment. We evaluate our algorithms through extensive simulations and experiments over an in-building wireless testbed.Keywords
This publication has 6 references indexed in Scilit:
- SyncScan: practical fast handoff for 802.11 infrastructure networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- SSCHPublished by Association for Computing Machinery (ACM) ,2004
- Multi-channel mac for ad hoc networksPublished by Association for Computing Machinery (ACM) ,2004
- Centralized channel assignment and routing algorithms for multi-channel wireless mesh networksACM SIGMOBILE Mobile Computing and Communications Review, 2004
- Lagrangean Based Methods for Solving Large-Scale Cellular Network Design ProblemsWireless Networks, 2003
- MACAWPublished by Association for Computing Machinery (ACM) ,1994