Standard-Compliant LTE-A Uplink Scheduling Scheme With Quality of Service

被引:16
作者
Ragaleux, Alexandre [1 ]
Baey, Sebastien [1 ]
Karaca, Mehmet [2 ]
机构
[1] UPMC Univ Paris 06, Sorbonne Univ, CNRS LIP6, UMR 7606, F-75005 Paris, France
[2] Lund Univ, Dept Elect & Informat Technol, S-22100 Lund, Sweden
关键词
LTE-A uplink; opportunistic scheduling; quality of service (QoS); single-carrier frequency-division multiple access (SC-FDMA); wireless networks; CROSS-LAYER OPTIMIZATION; OFDM WIRELESS NETWORKS; RESOURCE-ALLOCATION; ALGORITHMS; FRAMEWORK;
D O I
10.1109/TVT.2017.2654299
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we focus on uplink scheduling with the practical constraints imposed by the Long-Term Evolution/Long-Term Evolution-Advanced (LTE/LTE-A) standard. We consider multimedia traffic generated by mobile users with heterogeneous quality-of-service (QoS) requirements. To tackle the resulting time and frequency problem, we then propose an adaptive and potential aware scheduling scheme (APASS), which is standard compliant and covers a wide range of scheduling objectives. This scheduling scheme is composed of three algorithms, which work jointly to provide an efficient solution. Our performance evaluation shows that the APASS outperforms other state-of-the-art scheduling schemes in terms of user satisfaction and delay.
引用
收藏
页码:7207 / 7222
页数:16
相关论文
共 39 条
[1]   Dynamic bandwidth allocation algorithms for high-speed data wireless networks [J].
Andrews, M ;
Borst, SC ;
Dominique, F ;
Jelenkovic, PR ;
Kumaran, K ;
Ramakrishnan, KG ;
Whiting, PA .
BELL LABS TECHNICAL JOURNAL, 1998, 3 (03) :30-49
[2]  
[Anonymous], 2014, TECH REP
[3]  
[Anonymous], PROOF SEARCH SPACE S
[4]  
[Anonymous], 3GPP REL
[5]  
[Anonymous], 2004, P INT S PERF EV COMP
[6]  
[Anonymous], 2017, 3GPP TS 36.213
[7]  
[Anonymous], RIV MOD WIR SUIT
[8]   Local ratio:: A unified framework for approximation algorithms -: In memoriam:: Shimon!Even -: 1935-2004 [J].
Bar-Yehuda, R ;
Bendel, K ;
Freund, A ;
Rawitz, D .
ACM COMPUTING SURVEYS, 2004, 36 (04) :422-463
[9]   A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM [J].
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1981, 21 (02) :152-171
[10]  
Blankenship YW, 2004, VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7, P4175