By Topic

Dynamic Subchannel and Power Allocation in OFDMA-Based DF Cooperative Relay Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Hongxing Li ; Inst. of Wireless Commun. Technol., Shanghai Jiao Tong Univ., Shanghai ; Hui Yu ; Hanwen Luo ; Jia Guo
more authors

This paper focuses on subchannel and power allocation problem in OFDMA-based decode-and-forward (DF) cooperative relay networks. The objective of this problem is to maximize the total data rate under the constraints of joint total transmission power and subchannels occupation, while maintaining the maximum fairness among multiple relay nodes. We transform this mixed integer programming problem to a standard convex optimization one through Lagrangian relaxation method. Accordingly, the optimal solution can be achieved by using Karush-Kuhn-Tucker (KKT) conditions. In addition, we propose two suboptimal subchannel allocation schemes with and without subchannel permutation (SP), which reduce significantly the computational complexity with small performance loss. The simulation results show that the performance of the proposed suboptimal algorithms with SP approaches asymptotically that of the optimal algorithm and with the increment of the number of relay nodes.

Published in:

Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE

Date of Conference:

Nov. 30 2008-Dec. 4 2008