Skip to content

A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference (VTC Fall) 2011
Publisher or commissioning bodyInstitute of Electrical and Electronics Engineers (IEEE)
Publication dateSep 2011
Pages1 - 5
Number of pages5
ISBN (Print)9781424483280
DOIs
StatePublished

Publication series

Name
ISSN (Print)10903038

Abstract

In this paper we present a distributed, fast and fair resource allocation algorithm for a multiuser, wireless LTE OFDMA channel. Extending our previous work, we propose additional efficiency enhancements and discuss the protocol issues involved. We further explore the trade-offs between performance and costs and present an analysis of the overhead and time requirements. The proposed algorithm partitions the users of the wireless network into coalitions and, using the game theoretic concept of the Nash Bargaining Solution (NBS), offers a cooperative solution to the subcarrier allocation problem. The use of the NBS ensures that the fairness provided matches that offered by the widely accepted Proportional Fair (PF) scheduler. Simulation results show that the sum rate achieved can be tuned to be almost equivalent to the sum rate of the PF scheduler, while only requiring limited resources and exchange of information between nodes. At the same time, the extensive efficiency enhancements and its distributed nature render the algorithm fast and low-complexity enough to be suitable for implementation in a real-time wireless system.

Additional information

Rose publication type: Conference contribution Additional information: With accompanying conference presentation. Sponsorship: This research was funded by Toshiba Research Europe Limited (TREL) and Great Western Research (GWR). Terms of use: Copyright ©2011 IEEE. Reprinted with permission, from 'Vatsikas, S. ; Armour, S. ; De Vos, M. ; Lewis, T. ; 'A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution'; IEEE VTC Conference Fall, September 2011. 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 pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Research areas

  • wireless LTE OFDMA channel, Nash Bargaining Solution (NBS), Proportional Fair (PF) scheduler

Documents

Documents

DOI

View research connections

Related faculties, schools or groups