Computationally efficient bandwidth allocation and power control for OFDMA
IEEE Transactions on Wireless Communications
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints
IEEE Transactions on Wireless Communications
Downlink Radio Resource Allocation for Multi-Cell OFDMA System
IEEE Transactions on Wireless Communications
Efficient optimal and suboptimal radio resource allocation in OFDMA system
IEEE Transactions on Wireless Communications
Low complexity subcarrier and power allocation for utility maximization in uplink OFDMA systems
IEEE Transactions on Wireless Communications - Part 1
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Resource Allocation for OFDMA Relay Networks With Fairness Constraints
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
International Journal of Communication Systems
| Hi-index | 0.01 |
Given the availability of multiple orthogonal channels and multimedia transmission rate requirements from multiple wireless OFDMA users, we are interested in a joint channel, power and rate assignment scheme that satisfies the given requirements with the minimum total transmit power. Algorithms for finding suboptimal and optimal solutions to sum power minimization resource allocation problems in OFDMA-based networks haven been proposed. But the complexity of finding the optimal solution is prohibitively high. We present two efficient algorithms with which each channel (sub-carrier) is assigned to at most one user. The first approach, which gives near-optimal solutions, employs a dynamic programming (DP) based tree search and adopts a fair initial condition that offers every user all available channels and removes a channel from all but one user at each stage. Each removal is based on the criterion of the least total power increase. Using the DP-based solution as the initial upper bound and the partial path cost used in the DP approach as the lower bound for each visited node, we develop an efficient branch-and-bound based algorithm that guaranteed to lead to the optimal solution. The average complexities of both algorithms are evaluated and effective schemes to further reduce the required complexity are proposed. We also provide performance and complexity comparisons with other suboptimal algorithms that are modified from the existing ones.