A distributed algorithm for wireless resource allocation using coalitions and the Nash Bargaining Solution

Stefanos Vatsikas, Simon Armour, Marina De Vos, Tim Lewis

Research output: Chapter in Book/Report/Conference proceedingChapter

7 Citations (Scopus)
127 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings
Place of PublicationPiscataway, NJ
PublisherIEEE
Number of pages5
ISBN (Electronic)978-1-4244-8331-0
ISBN (Print)978-1-4244-8332-7
DOIs
Publication statusPublished - May 2011
Event2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011 - Budapest, Hungary
Duration: 1 May 2011 → …

Publication series

NameIEEE Vehicular Technology Conference
PublisherInstitute of Electrical and Electronics Engineers

Conference

Conference2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011
CountryHungary
CityBudapest
Period1/05/11 → …

Fingerprint Dive into the research topics of 'A distributed algorithm for wireless resource allocation using coalitions and the Nash Bargaining Solution'. Together they form a unique fingerprint.

Cite this