SINR-based ChannelAssignment forDense Wireless LANs
Xiangping Qin, Xingang Guo, Randall Berry · 2005
Thebiggest challenge inchannel assignment fordense, multi-celllAP wireless LANsistoarrange co- channel cells soastomaximize theaggregate network throughput. Mostprevious workmodelsthisproblem asa vertex coloring problem. Inthispaperwe model itasa non-linear optimization problem tomaximize overall networkthroughput. We provethatthenew optimization problem isNP-hard andvertex-coloring is a simplified case. We thenpropose a polynomial time heuristic algorithm called MIF(Most-Interfered -First) for channel assignment. Theperformance foralinetopology isanalyzed. Simulations forrandomtopologies-show that MIF consistently produces better network throughput thanvertex-coloring basedheuristic algorithms withless computation cost.