Published in Qin, X., Guo, X., & Berry, R. (2005). SINR-based channel assignment for dense wireless LANs. (2005). 2005 International Conference on Wireless Networks, Communications and Mobile Computing, 692-697. doi: 10.1109/WIRLES.2005.1549491 ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.


The biggest challenge in channel assignment for dense, multi-cell/AP wireless LANs is to arrange co-channel cells so as to maximize the aggregate network throughput. Most previous work models this problem as a vertex coloring problem. In this paper we model it as a non-linear optimization problem to maximize overall network throughput. We prove that the new optimization problem is NP-hard and vertex-coloring is a simplified case. We then propose a polynomial time heuristic algorithm called MIF (Most-Interfered-First) for channel assignment. The performance for a line topology is analyzed. Simulations for random topologies show that MIF consistently produces better network throughput than vertex-coloring based heuristic algorithms with less computation cost.