Efficient channel assignment algorithm under cochannel and adjacent channel interference constraint

Channel assignment is the key to spectrum management. In this paper, the channel assignment problem is modeled as a graph coloring formulation. The task of assigning a limited number of channels to transmitters under a set of constraints in an efficient way is an NP-complete optimization problem. We apply a powerful metaheuristic search algorithm, namely a simulated annealing algorithm together with a sequential algorithm, to tackle this type of problem. In order to evaluate the performance of the methodology, the algorithm is tested on a number of benchmark problems and the results are compared with the existing ones for the same set of constraints. It is found that the results obtained by our approach are comparable to those obtained by existing methods.