One of the most complex tasks in setting up a GSM network is the appropriate choice of the set of channels to be used on each BTS (Base Transceiver Station, or “site”), so as to minimize as far as possible the interference inherently caused by the reuse of the same channels in other cells. The Channel Allocation Problem (CAP) is combinatorial, very highly constrained (particularly due the Italian RF regulations), and NP-complete. An optimizer based on the Simulated Annealing technique was developed, and used in conjunction with several heuristics, in order to make it efficient and able to give good frequency plans.
A Simulated Annealing based Algorithm for the Optimisation of the Channel Allocation Problem in GSM networks
GIRDINIO, PAOLA;NERVI, MARIO;ROSSI, MANSUETO
2005-01-01
Abstract
One of the most complex tasks in setting up a GSM network is the appropriate choice of the set of channels to be used on each BTS (Base Transceiver Station, or “site”), so as to minimize as far as possible the interference inherently caused by the reuse of the same channels in other cells. The Channel Allocation Problem (CAP) is combinatorial, very highly constrained (particularly due the Italian RF regulations), and NP-complete. An optimizer based on the Simulated Annealing technique was developed, and used in conjunction with several heuristics, in order to make it efficient and able to give good frequency plans.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
