Optimal channel assignment in wireless communication networks with distance and frequency interferences

摘要

Fixed channel assignment in wireless communication networks is a significant combinatorial optimization problem that must be solved. Since the combinatorial optimization problem is NP-hard, many different heuristics have been proposed for its solution. In this paper, we consider two types of interference conditions for channel assignment: a co-channel interference within distance of two cells, and an adjacent channel interference within the same and the adjacent cells. Our goal is to minimize or disallow these two types of interference in order to achieve optimal channel assignment. First we present our recursive search algorithm together with a neighborhood improvement structure. Then we minimize or disallow the two types of interference in order to achieve optimal channel assignment. We suggest a general approach combining several important heuristics. Our experimental results show that our algorithm is an improvement on other known approaches.