Minimization of frequency assignment span in cellular networks

Rouskas, AN; Kazantzakis, MG; Anagnostou, ME

dc.contributor.author	Rouskas, AN	en
dc.contributor.author	Kazantzakis, MG	en
dc.contributor.author	Anagnostou, ME	en
dc.date.accessioned	2014-03-01T01:14:48Z
dc.date.available	2014-03-01T01:14:48Z
dc.date.issued	1999	en
dc.identifier.issn	0018-9545	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13229
dc.subject	cellular networks	en
dc.subject	frequency assignment	en
dc.subject	minimum span	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.classification	Transportation Science & Technology	en
dc.subject.other	Algorithms	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Constraint theory	en
dc.subject.other	Frequency allocation	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Iterative methods	en
dc.subject.other	Radio interference	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Cellular networks	en
dc.subject.other	Convex maximization theory	en
dc.subject.other	Frequency assignment	en
dc.subject.other	Cellular radio systems	en
dc.title	Minimization of frequency assignment span in cellular networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/25.765004	en
heal.identifier.secondary	http://dx.doi.org/10.1109/25.765004	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	We consider the problem of minimizing the span of frequencies required to satisfy a certain demand in a cellular network under certain interference constraints. A new iterative algorithm exploiting the special nature of such systems is presented. The general procedure has the ability to react to variations of the traffic demand as more and more channels are being assigned to cell requirements. Allocations of channels to cells are made with a method that borrows insight from the theory of convex maximization. This method is, however, equivalent to simple and fast heuristics when selecting proper values for its parameters. Our technique yields quite encouraging results, showing that it represents an efficient alternative to attacking this type of problems.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	IEEE Transactions on Vehicular Technology	en
dc.identifier.doi	10.1109/25.765004	en
dc.identifier.isi	ISI:000080371700020	en
dc.identifier.volume	48	en
dc.identifier.issue	3	en
dc.identifier.spage	873	en
dc.identifier.epage	882	en