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

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

Research output: Contribution to conferencePaper

11 Citations (Scopus)

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.
Original languageEnglish
DOIs
Publication statusPublished - Sep 2011
EventVehicular Technology Conference (VTC Fall), 2011 IEEE -
Duration: 5 Sep 20118 Sep 2011

Conference

ConferenceVehicular Technology Conference (VTC Fall), 2011 IEEE
Period5/09/118/09/11

Fingerprint

Resource allocation
Wireless networks
Network protocols
Costs

Cite this

Vatsikas, S., Armour, S., De Vos, M., & Lewis, T. (2011). A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution. Paper presented at Vehicular Technology Conference (VTC Fall), 2011 IEEE, . https://doi.org/10.1109/VETECF.2011.6093224

A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution. / Vatsikas, Stefanos; Armour, Simon; De Vos, Marina; Lewis, Tim.

2011. Paper presented at Vehicular Technology Conference (VTC Fall), 2011 IEEE, .

Research output: Contribution to conferencePaper

Vatsikas, S, Armour, S, De Vos, M & Lewis, T 2011, 'A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution' Paper presented at Vehicular Technology Conference (VTC Fall), 2011 IEEE, 5/09/11 - 8/09/11, . https://doi.org/10.1109/VETECF.2011.6093224
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. 2011. Paper presented at Vehicular Technology Conference (VTC Fall), 2011 IEEE, . https://doi.org/10.1109/VETECF.2011.6093224
Vatsikas, Stefanos ; Armour, Simon ; De Vos, Marina ; Lewis, Tim. / A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution. Paper presented at Vehicular Technology Conference (VTC Fall), 2011 IEEE, .
@conference{12ace4183919458ba5c91670e7e4a2c1,
title = "A fast and fair algorithm for distributed subcarrier allocation using coalitions and the Nash bargaining solution",
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.",
author = "Stefanos Vatsikas and Simon Armour and {De Vos}, Marina and Tim Lewis",
year = "2011",
month = "9",
doi = "10.1109/VETECF.2011.6093224",
language = "English",
note = "Vehicular Technology Conference (VTC Fall), 2011 IEEE ; Conference date: 05-09-2011 Through 08-09-2011",

}

TY - CONF

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

AU - Vatsikas, Stefanos

AU - Armour, Simon

AU - De Vos, Marina

AU - Lewis, Tim

PY - 2011/9

Y1 - 2011/9

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

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

UR - http://dx.doi.org/10.1109/VETECF.2011.6093224

U2 - 10.1109/VETECF.2011.6093224

DO - 10.1109/VETECF.2011.6093224

M3 - Paper

ER -