A novel sub-carrier allocation algorithm in 3G LTE system

Chen, Yueyun; Deng, Xiaohui

doi:10.1049/cp:20070187

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sub-carrier allocation problem is addressed in the literature with different approaches; among others, the most important are the resource allocation methods based on the maximization of the instantaneous (or ergodic) rates [1], the approaches that aim to maximize the system throughput and fairness [2], the techniques that perform the sub-carriers allocation in order to minimize the interferences among users in a multicellular environment [3], [4], and the methods based on the cross-layer principle that jointly consider channel quality, QoS constraints and fairness [5]. However, the strategies described in [1]- [5] perform a subcarrier allocation optimizing just for one QoS class at time or does not take in account any QoS constraints for the traffic.…”

Section: Introductionmentioning

confidence: 99%

An Optimized Resource Allocation Scheme Based on a Multidimensional Multiple-Choice Approach with Reduced Complexity

Bartoli

Tassi

Marabissi

et al. 2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Long Term Evolution (LTE) is considered one of the main candidate to provide wireless broadband access to mobile users. Among main LTE characteristics, flexibility and efficiency can be guaranteed by resorting to suitable resource allocation schemes, in particular by adopting adaptive OFDM schemes. This paper proposes a novel solution to the subcarrier allocation problem for the LTE downlink that takes into account the queues length, the QoS constraints and the channel conditions. Each user has different queues, one for each QoS class, and can transmit with a different data rate depending on the propagation conditions. The proposed algorithm defines a value of each possible sub-carrier assignment as a linear combination of all the inputs following a cross-layer approach. The problem is formulated as a Multidimensional Multiplechoice Knapsack Problem (MMKP) whose optimal solution is not feasible for our purposes due to the too long computing time required to find it. Hence, a novel efficient heuristic has been proposed to solve the problem. Results shows good performance of the proposed resource allocation scheme both in terms of throughput and delay while guarantees fairness among the users. Performance has been compared also with fixed allocation scheme and round robin.

show abstract