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

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. 