Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.