Abstract
In this paper we develop distributed resource allocation and scheduling algorithms for the uplink of an orthogonal frequency division multiple access (OFDMA) wireless network. We consider a time-slotted model, where in each time-slot the users are assigned to subchannels consisting of groups of OFDM tones. Each user can also allocate its transmission power among the subchannels it is assigned. We consider distributed algorithms for accomplishing this, where each user’s actions depend only on knowledge of their own channel gains. Assuming a collision model for each subchannel, we characterize an optimal policy which maximizes the system throughput and also give a simpler sub-optimal policy. We study the scaling behavior of these policies in several asymptotic regimes for a broad class of fading distributions.
Comments
Published in Qin, X., & Berry, R. (2006). Distributed resource allocation and scheduling in OFDMA wireless networks. Fortieth Asilomar Conference on Signals, Systems and Computers, 2006. ACSSC '06, 1942 - 1946. doi: 10.1109/ACSSC.2006.355102 ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.