Low Complexity in Exaggerated Earliest Deadline First Approach for Channel and QoS-aware Scheduler

Abstract

Long Term Evolution (LTE) is a Quality of Service (QoS) provisioning wireless network for today's technology and as well as for future demands. There is a high demand for better network performance over LTE network, either for real-time or non-real-time traffic. Specifically, the existing scheduling algorithms for real-time application, Exponential/Proportional Fair (EXP/PF), Proportional Fair (PF), and Modified-Largest Weighted Delay First (M-LWDF) have not fully optimized in LTE network. Hence, this paper aims to deliver new scheduling algorithm in the LTE network which overcomes several QoS and channel concerns. Several algorithms were studied, tested and compared which includes EXP/PF, PF, and M-LWDF, which are the popular scheduling algorithms for real-time application in today's deployment. A typical LTE network is simulated and several experiments were conducted. Extensive simulation results showed that our proposed scheduling algorithm, Exaggerated Earliest Deadline First (E2DF), has outperformed the three existing scheduling algorithms. The proposed algorithm is a LTE compliance module and it able to provide great performance improvement as compared to the other algorithms for real-time application.  Index Terms-LTE, scheduling algorithm, quality of service, 4G, wireless network.

A Scheduling Algorithm Based Self-Learning Technique for Smart Grid Communications over 4G Networks

“…Several algorithms have been proposed in order to improve the scheduling for both Real-Time applications (RT) and Non-Real time applications (NRT). Such as Proportional Fairness (PF) which takes into account the experienced channel quality and the past average throughput of the users, which means it aims at improving fairness in term of throughput regardless other QoS requirements [9], [10]. Moreover, it doesn't concern about delay constraint therefore it is suitable only for NRT applications as in (1).…”

“…where is the waiting time of the packet in the queue and is the time when the packet served. ( ) is defined as the difference in time between budget delay ( , ( )) and ( ) delay as in (10).…”