Design of an Efficient Channel Block Retuning |
| |
Authors: | Barbéra Vincent Jaumard Brigitte |
| |
Affiliation: | (1) Adopt, 3535 Queen Mary, Montréal, Québec, Canada, H3T 1V6;(2) Département de génie électrique et de génie informatique, Succursale Centre-ville, École Polytechnique de Montréal, Case Postale 6079, Montréal, Québec, Canada, H3C 3A7 |
| |
Abstract: | 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. |
| |
Keywords: | retuning frequency assignment cellular telephone system greedy heuristic ascent– descent heuristic tabu search |
本文献已被 SpringerLink 等数据库收录! |
|