Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Convex Optimization
Bit loading algorithms for cooperative OFDM systems
EURASIP Journal on Wireless Communications and Networking - Multicarrier Systems
Practical algorithms for a family of waterfilling solutions
IEEE Transactions on Signal Processing
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints
IEEE Transactions on Wireless Communications
Power Allocation Schemes for Amplify-and-Forward MIMO-OFDM Relay Links
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Cooperative communication in wireless networks
IEEE Communications Magazine
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Resource Allocation Schemes for the Heterogeneous OFDMA System with Multiple Ad Hoc Relays
Wireless Personal Communications: An International Journal
Resource Allocation of Limited Feedback in Clustered Wireless Mesh Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
This paper investigates the Resource allocation problem in OFDMA-based decode-and-forward cooperative communication systems. The objective is to maximize the sum throughput under the constraints of joint total transmission power and subchannels occupation, while maintaining the maximum fairness among multiple relay nodes. Since the optimal solution to this combinatorial problem is extremely computationally complex to obtain, we propose a low-complexity suboptimal algorithm that allocates subchannel and power separately. In the proposed algorithm, subchannel allocation over the relay nodes is first performed under the assumption of equal power distribution. Then, an optimal power allocation algorithm named multi-level water-filling is used to maximize the sum rate. The simulation results show that the performance of the proposed algorithm can approach asymptotically to that of the optimal algorithm while enhancing the fairness among all relay nodes and reducing computational complexity from exponential to linear with the number of subchannels. It is also shown that the proposed equal power distribution algorithm with subchannel permutation (SP) outperforms the one without SP.