SINR-based channel assignment for dense wireless LANs

Qin Xiangping*, Guo Xingang, Randall Berry

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publication2005 International Conference on Wireless Networks, Communications and Mobile Computing
Pages692-697
Number of pages6
DOIs
StatePublished - 2005
Event2005 International Conference on Wireless Networks, Communications and Mobile Computing - Maui, HI, United States
Duration: Jun 13 2005Jun 16 2005

Publication series

Name2005 International Conference on Wireless Networks, Communications and Mobile Computing
Volume1

Other

Other2005 International Conference on Wireless Networks, Communications and Mobile Computing
Country/TerritoryUnited States
CityMaui, HI
Period6/13/056/16/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'SINR-based channel assignment for dense wireless LANs'. Together they form a unique fingerprint.

Cite this