The most accurate approaches to frequency assignment problems minimize a cost function based on signal-to-interference ratios at points where reception is required. The merits of this approach are counterbalanced by much greater requirements for computational resources than for the traditional approach using binary frequency separation constraints. This can make run times unrealistic for the largest problems. In this paper the merits of the signal-to-interference based cost function are confirmed, but it is shown that algorithms are faster and give better quality results if this cost function is combined with the binary constraint approach. Two types of algorithm are used to illustrate the combined approach, simulated annealing and a new ant colony system algorithm. The combined approach studied is applicable to all the main classes of frequency assignment problem.

Frequency assignment, multiple interference and binary constraints / Graham, Js; Montemanni, Roberto; Moon Jim, Nj; Smith, Dh. - In: WIRELESS NETWORKS. - ISSN 1022-0038. - 14:4(2008), pp. 449-464.

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Powered by IRIS-about IRIS-Utilizzo dei cookie

 Copyright © 2021