
Research on Scheduling Algorithms in Uplink of LTE System
Author(s) -
Chuhua Yang,
Jun He
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/782/3/032097
Subject(s) - enodeb , computer science , telecommunications link , round robin scheduling , dynamic priority scheduling , fair share scheduling , scheduling (production processes) , earliest deadline first scheduling , rate monotonic scheduling , computer network , network packet , quality of service , real time computing , algorithm , user equipment , distributed computing , mathematical optimization , base station , mathematics
Downlink scheduling of LTE packet scheduling has been widely studied, while uplink scheduling is rarely studied. Aiming at the problem that uplink scheduling can not guarantee the transmission of real-time traffic packets within the delay period, a new uplink scheduling algorithm is proposed, we establish the target integer linear programming model by the delay constraints of real-time traffic. And aiming at the problem that the bandwidth of low priority traffic is insufficient and the overall QoS is affected when multi-class traffic is processed, a new scheduling algorithm for multi-class traffic is proposed, which includes multi-class traffic scheduling algorithm for eNodeB and priority adjustment algorithm for UE. Through our algorithm, emergency UE is always scheduled first, the algorithm can also maximize MAC throughput and satisfy the minimum QoS constraints. It can also improve the problem that the bandwidth of low priority traffic is insufficient. The experimental results show that the proposed algorithm can significantly improve LTE uplink performance.