An Optimal Application-Aware Resource Block Scheduling in LTE
Tugba Erpek, Ahmed Abdelhadi, and T. Charles Clancy

TL;DR
This paper proposes an application-aware resource scheduling method for LTE that optimizes user satisfaction and QoS by prioritizing real-time applications and guaranteeing minimum resource allocations.
Contribution
It introduces a novel utility-based scheduling model with utility proportional fairness, ensuring optimal resource allocation for diverse traffic types in LTE systems.
Findings
Higher user satisfaction compared to conventional methods
Effective prioritization of real-time applications
Guarantees minimum QoS for all users
Abstract
In this paper, we introduce an approach for application-aware resource block scheduling of elastic and inelastic adaptive real-time traffic in fourth generation Long Term Evolution (LTE) systems. The users are assigned to resource blocks. A transmission may use multiple resource blocks scheduled over frequency and time. In our model, we use logarithmic and sigmoidal-like utility functions to represent the users applications running on different user equipments (UE)s. We present an optimal problem with utility proportional fairness policy, where the fairness among users is in utility percentage (i.e user satisfaction with the service) of the corresponding applications. Our objective is to allocate the resources to the users with priority given to the adaptive real-time application users. In addition, a minimum resource allocation for users with elastic and inelastic traffic should be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Network Optimization · Advanced MIMO Systems Optimization · Wireless Communication Networks Research
