Cart (Loading....) | Create Account
Close category search window
 

Sum Rate Maximized Resource Allocation in Multiple DF Relays Aided OFDM Transmission

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

2 Author(s)
Tao Wang ; ICTEAM Inst., Univ. Catholique de Louvain, Louvain-la-Neuve, Belgium ; Vandendorpe, L.

In relay-aided wireless transmission systems, one of the key issues is how to manage the energy resource at the source and each individual relay, to optimize a certain performance metric. This paper addresses the sum rate maximized resource allocation (RA) problem in an orthogonal frequency division modulation (OFDM) transmission system assisted by multiple decode-and-forward (DF) relays, subject to the individual sum power constraints of the source and the relays. In particular, the transmission at each subcarrier can be in either the direct mode without any relay assisting, or the relay-aided mode with one or several relays assisting. We propose two RA algorithms which optimize the assignment of transmission mode and source power for every subcarrier, as well as the assisting relays and the power allocation to them for every {relay-aided} subcarrier. First, it is shown that the considered RA problem has zero Lagrangian duality gap when there is a big number of subcarriers. In this case, a duality based algorithm that finds a globally optimum RA is developed. Most interestingly, the sensitivity analysis in convex optimization theory is used to derive a closed-form optimum solution to a related convex optimization problem, for which the method based on the Karush-Kuhn-Tucker (KKT) conditions is not applicable. Second, a coordinate-ascent based iterative algorithm, which finds a suboptimum RA but is always applicable regardless of the duality gap of the RA problem, is developed. The effectiveness of these algorithms has been illustrated by numerical experiments.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:29 ,  Issue: 8 )

Date of Publication:

September 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.