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

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

doi:10.1109/VETECS.2011.5956236

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 or section in a book/report/conference proceeding › Chapter or section

7 Citations (SciVal)

228 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 language	English
Title of host publication	2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings
Place of Publication	Piscataway, NJ
Publisher	IEEE
Number of pages	5
ISBN (Electronic)	978-1-4244-8331-0
ISBN (Print)	978-1-4244-8332-7
DOIs	https://doi.org/10.1109/VETECS.2011.5956236
Publication status	Published - May 2011
Event	2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011 - Budapest, Hungary Duration: 1 May 2011 → …

Publication series

Name	IEEE Vehicular Technology Conference
Publisher	Institute of Electrical and Electronics Engineers

Conference

Conference	2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011
Country/Territory	Hungary
City	Budapest
Period	1/05/11 → …

Access to Document

10.1109/VETECS.2011.5956236

DeVos_vtc2011.pdf
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript, 172 KB

Cite this

A distributed algorithm for wireless resource allocation using coalitions and the Nash Bargaining Solution. / Vatsikas, Stefanos; Armour, Simon; De Vos, Marina et al.
2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings. Piscataway, NJ: IEEE, 2011. 5956236 (IEEE Vehicular Technology Conference).

Research output: Chapter or section in a book/report/conference proceeding › Chapter or section

Vatsikas, S, Armour, S, De Vos, M & Lewis, T 2011, A distributed algorithm for wireless resource allocation using coalitions and the Nash Bargaining Solution. in 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings., 5956236, IEEE Vehicular Technology Conference, IEEE, Piscataway, NJ, 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011, Budapest, Hungary, 1/05/11. https://doi.org/10.1109/VETECS.2011.5956236

@inbook{a85ebfdbe16640c6b32dbb009d26888f,

title = "A distributed algorithm for wireless resource allocation using coalitions and the Nash Bargaining Solution",

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.",

author = "Stefanos Vatsikas and Simon Armour and {De Vos}, Marina and Tim Lewis",

year = "2011",

month = may,

doi = "10.1109/VETECS.2011.5956236",

language = "English",

isbn = "978-1-4244-8332-7",

series = "IEEE Vehicular Technology Conference",

publisher = "IEEE",

booktitle = "2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings",

address = "USA United States",

note = "2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011 ; Conference date: 01-05-2011",

}

TY - CHAP

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

AU - Vatsikas, Stefanos

AU - Armour, Simon

AU - De Vos, Marina

AU - Lewis, Tim

PY - 2011/5

Y1 - 2011/5

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1109/VETECS.2011.5956236

U2 - 10.1109/VETECS.2011.5956236

DO - 10.1109/VETECS.2011.5956236

M3 - Chapter or section

SN - 978-1-4244-8332-7

T3 - IEEE Vehicular Technology Conference

BT - 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring - Proceedings

PB - IEEE

CY - Piscataway, NJ

T2 - 2011 IEEE 73rd Vehicular Technology Conference, VTC2011-Spring, May 15, 2011 - May 18, 2011

Y2 - 1 May 2011

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this