dc.contributor.author |
Kazantzakis, MG |
en |
dc.contributor.author |
Demestichas, PP |
en |
dc.contributor.author |
Tzifa, EC |
en |
dc.contributor.author |
Anagnostou, ME |
en |
dc.date.accessioned |
2014-03-01T01:15:01Z |
|
dc.date.available |
2014-03-01T01:15:01Z |
|
dc.date.issued |
1999 |
en |
dc.identifier.issn |
0090-6778 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/13287 |
|
dc.subject |
channel assignment |
en |
dc.subject |
FCA |
en |
dc.subject |
0-1 linear and quadratic programming |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.classification |
Telecommunications |
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 |
Linear programming |
en |
dc.subject.other |
Personal communication systems |
en |
dc.subject.other |
Problem solving |
en |
dc.subject.other |
Quadratic programming |
en |
dc.subject.other |
Telecommunication traffic |
en |
dc.subject.other |
Adaptive spectrum utilization |
en |
dc.subject.other |
Traffic adaptive channel allocation |
en |
dc.subject.other |
Cellular radio systems |
en |
dc.title |
Optimal adaptive spectrum utilization in cellular communications systems |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1109/26.795814 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/26.795814 |
en |
heal.language |
English |
en |
heal.publicationDate |
1999 |
en |
heal.abstract |
Efficient spectrum utilization in third-generation cellular systems has motivated the study of the traffic adaptive channel allocation problem: given the set of channels, the cell structure and the load to be accommodated in each cell find the optimal allocation of channels to cells, subject to the reuse distance constraints. In this paper, we extend this scheme in order to include time fluctuating traffic loads. The extended problem is formulated and solved by reduction to 0-1 (linear and quadratic) programming. |
en |
heal.publisher |
IEEE, Piscataway, NJ, United States |
en |
heal.journalName |
IEEE Transactions on Communications |
en |
dc.identifier.doi |
10.1109/26.795814 |
en |
dc.identifier.isi |
ISI:000083399400006 |
en |
dc.identifier.volume |
47 |
en |
dc.identifier.issue |
10 |
en |
dc.identifier.spage |
1469 |
en |
dc.identifier.epage |
1471 |
en |