Abstract
We consider the adaptive resource allocation problem in downlink Orthogonal Frequency Division Multiple Access (OFDMA) system with strict packet delay constraints in the range of . In this range of delay constraints, resource optimization has to be simultaneously performed over multiple time slots. Thus optimal allocation decisions require future Channel State Information (CSI) and packet arrival rate information. The causal nature of CSI combined with the increase in the number of optimization variables makes it a very challenging problem. We propose a two-step solution by separating scheduling from subcarrier and power allocation. Our proposed causal scheduler ensures delay guarantees by deriving a minimum data rate out of the user queues while minimizing transmit power in every time slot. The output rates are fed to the resource allocation block and the problem is formulated as a convex optimization problem. The subcarrier and power allocation decisions are made in order to satisfy the demanded rates within the peak power constraint. We address the feasibility of the physical layer resource allocation problem and develop efficient algorithms. When the problem is infeasible we devise a strategy which incurs minimum deviation from the proposed rates for maximum number of users. We show by simulations that our proposed scheme can efficiently utilize time variations as well as multiuser diversity in the system.
Highlights
Harsh wireless channel conditions, scarce bandwidth, and limited power resources require intelligent allocation schemes which can efficiently exploit channel variations
Due to the multi-carrier nature of Orthogonal Frequency Division Multiple Access (OFDMA) systems, enormous opportunities exist for dynamic subcarrier and power allocation strategies [2,3,4]
Most of the existing work on adaptive resource allocation schemes in OFDMA systems has focused on traffic types with delay constraints of either D = ∞ or D = 1
Summary
Scarce bandwidth, and limited power resources require intelligent allocation schemes which can efficiently exploit channel variations. The authors develop energy efficient scheduler with individual packet delay constraints by developing bounds on transmission rate and write the optimization problem. (i) The problem of achieving strict target delay constraints is stretched in the past and in the future and we can capture this dependence by developing certain bounds on data rate transmission in each time slot. (iii) The objective of MRS is to propose a minimum data rate for each user which is just sufficient to attain strict delay constraints of the packets. Since in our problem we have power allocation, plus exclusive subcarrier assignment constraint over D time slots the state space of our problem is very huge and dynamic programming techniques are not feasible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.