By Topic

Fair resource allocation using bargaining over OFDMA 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

4 Author(s)

This paper studies fair resource allocation schemes for orthogonal frequency-division multiple-access (OFDMA) with the decode-and-forward relaying strategy. To satisfy the heterogenous rate requirement of each user while considering the fairness and efficiency as performance indices, the bargaining theory is applied to allocate resource at a relay node to multiple source nodes. Motivated by the fact that each source's achievable rate on individual sub-carrier is limited by decodability constraint, we apply the Kalai-Smorodinsky bargaining (KSB) theory to allocate resource at the relay fairly. KSB ensures that all sources incur the same surplus rate penalty relative to the maximal surplus rate. To improve system efficiency, the Nash bargaining (NB) problem is formulated to maximize NB solution fairness criterion by exploiting multiuser diversity. A simple yet efficient algorithm is derived to assign sub-carrier and power at the relay for multiple users. Simulation results demonstrate that both KSB-based solution and NB solution can improve total rates while maintaining fairness among sources.

Published in:

Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on

Date of Conference:

15-18 Dec. 2009