Efficient channel assignment algorithm under cochannel and adjacentchannel interference constraint

摘要

Channel assignment is the key to spectrum management. In thispaper, the channel assignment problem is modeled as a graph coloringformulation. The task of assigning a limited number of channels totransmitters under a set of constraints in an efficient way is anNP-complete optimization problem. We apply a powerful metaheuristicsearch algorithm, namely a simulated annealing algorithm together with asequential algorithm, to tackle this type of problem. In order toevaluate the performance of the methodology, the algorithm is tested ona number of benchmark problems and the results are compared with theexisting ones for the same set of constraints. It is found that theresults obtained by our approach are comparable to those obtained byexisting methods