Reconfiguration of carrier assignment 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:15:07Z
dc.date.available	2014-03-01T01:15:07Z
dc.date.issued	1999	en
dc.identifier.issn	1022-0038	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13351
dc.subject	Cellular Network	en
dc.subject	cochannel interference	en
dc.subject	Satisfiability	en
dc.subject	Time Varying	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Carrier communication	en
dc.subject.other	Cochannel interference	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Constraint theory	en
dc.subject.other	Optimization	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Carrier assignment	en
dc.subject.other	Cellular networks	en
dc.subject.other	Cellular radio systems	en
dc.title	Reconfiguration of carrier assignment in cellular networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1023/A:1019184018902	en
heal.identifier.secondary	http://dx.doi.org/10.1023/A:1019184018902	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	We consider the problem of updating nominal carrier assignments in cellular networks, which dymamically operate with channel borrowing and reassignments, to match the time-varying offered traffic demands encountered on these systems. Assuming an existing assignment of nominal carriers and the new requirements in each cell, we formulate the problem of obtaining a new assignment such that the number of carriers required to meet the total traffic demand as well as the number of different assignments between the old and the new allocation are minimized. We introduce two approaches to obtain this new assignment. One approach treats the two objectives independently and is applicable to problems with cochannel interference constraints only. This approach produces a new assignment optimized with respect to the first goal, and then rearranges the frequencies of this new allocation so that the number of different assignments with respect to the previous allocation is minimum. A second approach aims at satisfying both goals at the same time and is applicable to problems with any type of interference constraints. The main advantage of this approach is the introduction of a single window parameter which can control the assignments produced, by favoring one goal at the expense of the other. We study several transition scenarios in macrocellular and microcellular environments, and show that in the majority of cases these objectives are conflicting, and that reconfiguration strongly depends on the amount of change of the traffic requirements.	en
heal.publisher	Baltzer Sci Publ, Bussum, Netherlands	en
heal.journalName	Wireless Networks	en
dc.identifier.doi	10.1023/A:1019184018902	en
dc.identifier.isi	ISI:000084514700001	en
dc.identifier.volume	5	en
dc.identifier.issue	6	en
dc.identifier.spage	429	en
dc.identifier.epage	443	en