Research And Improve The Channel Assignment Problem Algorithm Based On Graph Colouring

The Channel Assignment Problem(CAP)is an important aspect of cellular network. The selection of the channel assignment strategies is always aiming at achieving higher channel efficiency,better Qos,shorter channel search time and simpler application of the algorithm.The channel search time is correlated with the channel utilizing efficiency. So each solution plan is a compromise among these factors.In this paper,using the knowledge of graph theory,we have researched the channel assignment problem,which is based on the graph colouring.And then,we introduce an efficient frequency assignment strategy(coalesced CAP),which is derived from a multicolouring algorithm.Its model is based on a triangular-lattice mobile communication network.The results are obtained by the simulation to some well-known benchmark problems show that the stratege.We proposed is a better approach for solving the channel assignment problem.Next,we apply the coalesced CAP in realistic network.The results tell us that the strategy can reduce the complexity,improve the efficiency of algorithm,so it can be applied in practice.