Weighted coloring based channel assignment for WLANs

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.

[1]  Bojan Mohar.  Circular colorings of edge-weighted graphs , 2003, J. Graph Theory.

[2]  J. J. Garcia-Luna-Aceves,et al.  Collision avoidance and resolution multiple access for multichannel wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Heinz A. Hoppe,et al.  [Commercial products]. , 1969, Dentoscope.

[4]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[5]  Sariel Har-Peled,et al.  On conflict-free coloring of points and simple regions in the plane , 2003, SCG '03.

[6]  J. J. Garcia-Luna-Aceves,et al.  A channel access protocol for multihop wireless networks with multiple channels , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[7]  Yanghee Choi,et al.  Optimization of AP placement and channel assignment in wireless LANs , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[8]  Jiandong Li,et al.  Capacity evaluation of multi-channel multi-hop ad hoc networks , 2002, 2002 IEEE International Conference on Personal Wireless Communications.

[9]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[10]  Stefan Savage,et al.  SyncScan: practical fast handoff for 802.11 infrastructure networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Nitin H. Vaidya,et al.  Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver , 2004, MobiHoc '04.

[12]  Stephen B. Wicker,et al.  On the Complexity of Distributed Self-Configuration in Wireless Networks , 2003, Telecommun. Syst..

[13]  P. Karn,et al.  MACA-a New Channel Access Method for Packet Radio , 1990 .

[14]  P. Bahl,et al.  SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks , 2004, MobiCom '04.

[15]  Pradip K. Srimani,et al.  Fault tolerant distributed coloring algorithms that stabilize in linear time , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[16]  Dana Ron,et al.  Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Tzi-cker Chiueh,et al.  Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks , 2004, MOCO.

[18]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[19]  Geraldo Robson Mateus,et al.  Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems , 2003, Wirel. Networks.