A potential reduction approach to the frequency assignment problem
Discrete Applied Mathematics
A comparison of local search algorithms for radio link frequency assignment problems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Mobile Cellular Telecommunications: Analog and Digital Systems
Mobile Cellular Telecommunications: Analog and Digital Systems
| Hi-index | 0.00 |
Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel retuning of an urban network has to be done in several steps. The objective is then to define the steps in such a way that the increase in the interference level is minimum, and do not let it go further than a given threshold of minimum quality for the cellular network. We propose a greedy heuristic and an ascent---descent method including a Tabu Search module to retune a network in a given number of steps. All constraints of the channel assignment problem are taken into account (co-channel, adjacent channel, minimum channel spacing on antennas) as well as retuning constraints such as the number of steps and limits on the maximum number of cells which can be retuned at each step. Co-channel and adjacent channel constraints are expressed through compatibility matrices produced with a discretization of the signal-to-interference ratio. Numerical results are presented on a Bell Mobilité urban network of 359 cells.