An algorithm for the frequency assignment problem in the case of DVB-T allotments

Kateros, DA; Georgallis, PG; Katsigiannis, CI; Prezerakos, GN; Venieris, IS

dc.contributor.author	Kateros, DA	en
dc.contributor.author	Georgallis, PG	en
dc.contributor.author	Katsigiannis, CI	en
dc.contributor.author	Prezerakos, GN	en
dc.contributor.author	Venieris, IS	en
dc.date.accessioned	2014-03-01T02:51:33Z
dc.date.available	2014-03-01T02:51:33Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35549
dc.subject.other	Constraint graph	en
dc.subject.other	Frequency assignment problem	en
dc.subject.other	Frequency channels	en
dc.subject.other	Frequency plan	en
dc.subject.other	Interference matrix	en
dc.subject.other	Meta-heuristic techniques	en
dc.subject.other	Possible solutions	en
dc.subject.other	Spectrum usage	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer science	en
dc.subject.other	Simulated annealing	en
dc.subject.other	Tabu search	en
dc.subject.other	Traveling salesman problem	en
dc.subject.other	Frequency bands	en
dc.title	An algorithm for the frequency assignment problem in the case of DVB-T allotments	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-78827-0_64	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-78827-0_64	en
heal.publicationDate	2008	en
heal.abstract	In this paper, we investigate the allocation of frequency channels to DVB-T allotments for frequency Bands IV/V (UHF). The problem is modeled with a constraint graph represented by an interference matrix. The aim is to optimize the spectrum usage, so that the maximum number of possible channels is assigned to each allotment area. The problem is a variation of the Frequency Assignment Problem (FAP). We have developed an algorithm that uses metaheuristic techniques, in order to obtain possible solutions. Three versions of the algorithm, a Tabu Search, a Simulated Annealing, and a Genetic Algorithm version, are evaluated. We present and discuss comparative results of these versions for generated networks, as well as for real allotment networks that are included in the GE06 digital frequency plan produced by ITU during the RRC-06 conference. © 2008 Springer.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-78827-0_64	en
dc.identifier.volume	4818 LNCS	en
dc.identifier.spage	561	en
dc.identifier.epage	568	en