A Delay-Scheduler Coupled Game Theoretic Resource Allocation Scheme for LTE Networks

LTE standard defines classes with granular requirements in order to provide QoS with fast connectivity and high data rates. The basic Release-8 of LTE and the subsequent modifications do not specify any scheduling algorithm making the task of improving user satisfaction more difficult. In our work, we proposed a two-level scheduler with game theoretic application that distributes resources among classes with fairness and then implements a delay based scheduler to satisfy the strict levels of delay budget requirements of LTE classes. A coalition is formed between different class flows by use of bargaining cooperative game that allows for distribution of physical resource blocks in a fair manner via Shapely function. The delay based scheduler checks and compares users packet delay in a service class to make scheduling decisions in the downlink utilizing recent user reported channel conditions. Simulation results carried out with key performance matrices like packet loss ratio, throughput, fairness index and system delay prove the effectiveness of the proposed approach as compared to Exponential Rule, Proportional Fair and M-LWDF algorithms and its usefulness for supporting both real time and non-real time traffic is verified.