Home > Research > Publications & Outputs > An optimized resource allocation scheme based o...

Keywords

View graph of relations

An optimized resource allocation scheme based on a multidimensional multiple-choice approach with reduced complexity

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
  • Giulio Bartoli
  • Andrea Tassi
  • Dania Marabissi
  • Daniele Tarchi
  • Romano Fantacci
Close
Publication date2011
Host publication2011 IEEE International Conference on Communications (ICC)
Place of PublicationNew York
PublisherIEEE
Pages1-6
Number of pages6
ISBN (electronic)9781612842318
ISBN (print)9781612842325
<mark>Original language</mark>English
EventIEEE International Conference on Communications (ICC) - Kyoto, Japan
Duration: 5/06/20119/06/2011

Conference

ConferenceIEEE International Conference on Communications (ICC)
Country/TerritoryJapan
Period5/06/119/06/11

Publication series

NameIEEE International Conference on Communications
PublisherIEEE
ISSN (Print)1550-3607

Conference

ConferenceIEEE International Conference on Communications (ICC)
Country/TerritoryJapan
Period5/06/119/06/11

Abstract

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 sub-carrier 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 Multiple-choice 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.