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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A Simulated Annealing based Algorithm for the Optimisation of the Channel Allocation Problem in GSM networks |
Autori: | |
Data di pubblicazione: | 2005 |
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. |
Handle: | http://hdl.handle.net/11567/270011 |
Appare nelle tipologie: | 04.01 - Contributo in atti di convegno |