An Efficient CSC-Preserving Fixed channel Assignment Algorithm

Abstract

A critical issue in the design of a cellular radio network is to determine a spectru efficient and conflict-free allocation of cannels among the cells. In this paper, w propose a novel approach for the Fixed Channel Assignment (FCA) problem. By preserving the Co-Sit channel constraint throughout our algorithm and adopting a fine-tuning procedure to escape from a local minimum, we speedup the overall execution time and improve the convergence rate. Simulation results show that our algorithm achieve 100% convergence rate to solutions on eight benchmark problems. Furthermore, the number of iterations our algorithm required is fewer than all previous results. Such significant results indicate that our new fixed channel assignment problem.