By Topic

Network-Coding-Aware Dynamic Subcarrier Assignment in OFDMA-Based Wireless 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
$33 $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)
Xinyu Zhang ; Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA ; Baochun Li

Orthogonal frequency-division multiple access (OFDMA) has been integrated into emerging broadband wireless systems such as the IEEE 802.16 WirelessMAN. One critical problem in OFDMA is to assign multiple frequency bands (called subcarriers) to different users. Taking advantage of the frequency and multiuser diversities in OFDMA systems, dynamic subcarrier assignment mechanisms have been shown to achieve much higher downlink capacity than static assignment. A rich literature exists, which proposes medium-access-control- and physical-layer (MAC/PHY) schemes, aiming at exploiting the diversity gain with low implementation complexity. In this paper, we propose a cross-layer approach that explores the joint advantage of network coding and dynamic subcarrier assignment. With network coding, it becomes possible to assign the same subcarriers to different downlinks without causing interference. Consequently, our coding-aware assignment scheme improves the bandwidth efficiency and increases the downlink throughput by a substantial margin. In designing the scheme, we identify a tradeoff between diversity gain and the network coding advantage, which is critical to network performance in terms of throughput and fairness. To explore the tradeoff, we formulate the coding-aware assignment scheme as a mixed integer program and design a polynomial-time approximation algorithm that can be used in practical systems. We prove the asymptotic performance bound of the algorithm and demonstrate that it closely approximates the optimum under realistic experimental settings.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:60 ,  Issue: 9 )