In this paper a distributed, low-complexity, fast and fair resource allocation algorithm for a multiuser, wireless LTE OFDMA channel is proposed. Based on the game theoretic concept of the Nash Bargaining Solution and by grouping users into coalitions of size 2, a cooperative solution to the problem of subcarrier allocation is achieved. The fairness that our algorithm provides matches that offered by the widely accepted Proportional Fair (PF) scheduler. Our simulation results show that the proposed algorithm achieves a sum rate that is almost equivalent (i.e. 90%) to the sum rate achieved by the PF scheduler, while only requiring minimal exchange of information between nodes. At the same time, efficiency enhancements and its distributed nature render it fast and low-complexity enough to be implemented in a real-time wireless system.
|Translated title of the contribution||A distributed algorithm for wireless resource allocation using coalitions and the Nash bargaining solution|
|Title of host publication||IEEE 73rd Vehicular Technology Conference (VTC Spring), 2011|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||1 - 5|
|Number of pages||5|
|Publication status||Published - May 2011|
|Event||73rd Vehicular Technology Conference 2011 (VTC 2011-Spring) - Budapest, Hungary|
Duration: 1 May 2011 → …
|Conference||73rd Vehicular Technology Conference 2011 (VTC 2011-Spring)|
|Period||1/05/11 → …|
Bibliographical noteRose publication type: Conference contribution
Additional information: With accompanying conference poster
Sponsorship: The authors wish to acknowledge the financial support of Toshiba Research Europe Limited (TREL) and Great Western Research (GWR).
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.