Using a New Heuristic Algorithm to Solve Channel Assignment Problems in Cellular Radio Networks

In the channel assignment problem (CAP), frequencies are assigned to requested calls in a cellular mobile network subject to co-channel, adjacent channel and co-site constraints such that required bandwidth is minimized. In this paper, a new heuristic algorithm is proposed to solve the CAP and node-color and node-degree ordering of cells and row-wise and column-wise ordering of calls are used. The performance of proposed method is evaluated by solving 12 CAPs. Results show that this method can find more and better solutions with minimum required bandwidth in comparison with the other algorithms investigated in the paper. Other advantages of this method are convergence and simplicity