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

Fixed channel assignment in wireless communication networks is an important combinatorial optimization problem that must be solved for application problems. Since it is NP-hard, many different heuristics are proposed for its solution. We consider two types of interference conditions for channel assignment: a co-channel interference within distance of two cells and a 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 the neighborhood improvement structure. Then we minimize or disallow these 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 improves over known approaches.