By Topic

Dynamic Resource Allocation in OFDMA Systems with Full-Duplex and Hybrid Relaying

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)

In this paper, we formulate a joint optimization problem for resource allocation and scheduling in full-duplex orthogonal frequency division multiple access (OFDMA) relaying systems with amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols. Our problem formulation takes into account heterogeneous data rate requirements for delay sensitive users. Besides, a theoretically optimal hybrid relaying, which allows a dynamic selection between AF relaying and DF relaying protocols with full-duplex relays or half-duplex relays, is also considered in the problem formulation and serves as a performance benchmark. A dual decomposition method is employed to solve the resulting optimization problem and a novel distributed iterative resource allocation and scheduling algorithm with closed-form power and subcarrier allocation is derived. Simulation results illustrate that the proposed distributed algorithm requires only a small number of iterations to achieves practically the same performance as the optimal centralized algorithm.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011