dc.contributor.author |
Gotsis, AG |
en |
dc.contributor.author |
Koutsokeras, NTh |
en |
dc.contributor.author |
Constantinou, P |
en |
dc.date.accessioned |
2014-03-01T02:07:35Z |
|
dc.date.available |
2014-03-01T02:07:35Z |
|
dc.date.issued |
2012 |
en |
dc.identifier.issn |
09296212 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/29584 |
|
dc.subject |
Adaptive resource allocation |
en |
dc.subject |
Heuristic algorithm |
en |
dc.subject |
Integer linear programming |
en |
dc.subject |
Multi-class QoS |
en |
dc.subject |
Multi-objective optimization |
en |
dc.subject |
OFDMA |
en |
dc.subject.other |
Adaptive resource allocations |
en |
dc.subject.other |
Integer Linear Programming |
en |
dc.subject.other |
Multi objective optimizations (MOO) |
en |
dc.subject.other |
Multi-class |
en |
dc.subject.other |
OFDMA |
en |
dc.subject.other |
Approximation algorithms |
en |
dc.subject.other |
Heuristic algorithms |
en |
dc.subject.other |
Multiobjective optimization |
en |
dc.subject.other |
Orthogonal frequency division multiplexing |
en |
dc.subject.other |
Resource allocation |
en |
dc.subject.other |
Frequency division multiple access |
en |
dc.title |
Adaptive power and subchannel allocation for dual-class OFDMA packet data networks |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1007/s11277-010-0212-4 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/s11277-010-0212-4 |
en |
heal.publicationDate |
2012 |
en |
heal.abstract |
Adaptive Radio Resource Allocation exploiting the inherent frequency selectivity of the wireless medium as well as the multi-user diversity effect is expected to play a crucial role in providing high QoS on emerging OFDMA-based wireless networks. Although a plethora of studies concerning exclusively constant bit rate (CBR) or variable bit rate/best effort (BE) traffic has been published to date, limited amount of work has been devoted to the more practical mixed CBR-BE data traffic scenario over OFDM radio access networks. In this paper we attempt to deal with the specific heterogeneous allocation problem, namely the maximization of elastic users' sum-throughput while providing minimum data rate service to a subset of non-elastic users. The contribution of this work is twofold. First, due to the high complexity of the resource allocation problem, we propose a relaxation method based on the prioritization of CBR- over BE-class users during the subchannel allocation procedure. We devise a method for obtaining the exact performance penalty induced by the specific hypothesis when compared to the optimal (unprioritized) decision. Secondly, we develop a polynomial complexity approximation algorithm for allocating power and bandwidth, that employs the CBR-prioritization idea. The scheme is shown to experience a relatively low performance penalty compared to its upper bound and to outperform two representative algorithms from the literature. © Springer Science+Business Media, LLC. 2010. |
en |
heal.journalName |
Wireless Personal Communications |
en |
dc.identifier.doi |
10.1007/s11277-010-0212-4 |
en |
dc.identifier.volume |
64 |
en |
dc.identifier.issue |
4 |
en |
dc.identifier.spage |
681 |
en |
dc.identifier.epage |
702 |
en |