The most recent trend in the Information and Communication Technology world is toward an ever growing demand of mobile heterogeneous services that imply the management of different quality of service requirements and priorities among different type of users. The long-term evolution (LTE)/LTE-advanced standards have been introduced aiming to cope with this challenge. In particular, the resource allocation problem in downlink needs to be carefully considered. Herein, a solution is proposed by resorting to a modified multidimensional multiple-choice knapsack problem modeling, leading to an efficient solution. The proposed algorithm is able to manage different traffic flows taking into account users priority, queues delay, and channel conditions achieving quasi-optimal performance results with a lower complexity. The numerical results show the effectiveness of the proposed solution with respect to other alternatives.

Downlink cross-layer scheduling strategies for long-term evolution and long-term evolution-advanced systems / Bartoli G. ; Fantacci R.; Marabissi D.; Tarchi D.; Tassi A.. - In: WIRELESS COMMUNICATIONS AND MOBILE COMPUTING. - ISSN 1530-8677. - STAMPA. - 15:(2015), pp. 1234-1246. [10.1002/wcm.2406]

Downlink cross-layer scheduling strategies for long-term evolution and long-term evolution-advanced systems

BARTOLI, GIULIO;FANTACCI, ROMANO;MARABISSI, DANIA;TARCHI, DANIELE;TASSI, ANDREA
2015

Abstract

The most recent trend in the Information and Communication Technology world is toward an ever growing demand of mobile heterogeneous services that imply the management of different quality of service requirements and priorities among different type of users. The long-term evolution (LTE)/LTE-advanced standards have been introduced aiming to cope with this challenge. In particular, the resource allocation problem in downlink needs to be carefully considered. Herein, a solution is proposed by resorting to a modified multidimensional multiple-choice knapsack problem modeling, leading to an efficient solution. The proposed algorithm is able to manage different traffic flows taking into account users priority, queues delay, and channel conditions achieving quasi-optimal performance results with a lower complexity. The numerical results show the effectiveness of the proposed solution with respect to other alternatives.
15
1234
1246
Bartoli G. ; Fantacci R.; Marabissi D.; Tarchi D.; Tassi A.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2158/936939
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact