Channel Assignment Problem in Cellular Mobile Network: A Distributed Constraint Satisfaction Approach

Since the natural resources of electromagnetic spectrum are strictly administrated, the channel assignment problem (CAP) has been an important issue for cellular mobile network. CAP is a well-known NP-hard problem, which is to minimize the maximum of channel utilization, while guaranteeing the voice quality. In this paper, we model CAP as a Distributed Constraint Satisfaction Problem (DCSP) with fully considerations on all kinds of interference constraints. A kind of distributed backtracking algorithm (DBA) is proposed to solve this DCSP problem. Simulation results show that, comparing with the similar previous work, our approach can achieve much tight lower bounds on the number of required channels with related less computation time and cost.