Please use this identifier to cite or link to this item: https://doi.org/10.1109/PIMRC.2009.5450219
Title: On the Nash equilibrium solutions of integer bit loading OFDMA resource allocation games
Authors: Liang, Z.
Chew, Y.H.
Ko, C.C. 
Issue Date: 2009
Source: Liang, Z., Chew, Y.H., Ko, C.C. (2009). On the Nash equilibrium solutions of integer bit loading OFDMA resource allocation games. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC : -. ScholarBank@NUS Repository. https://doi.org/10.1109/PIMRC.2009.5450219
Abstract: We address the allocation of subcarriers, bits and power among the base stations (BSs) of downlink multi-cell OFDMA systems using the non-cooperative game theoretic approach. The utility function of a player is defined as the difference between the revenue generated from transmitting the bits and the cost of the power consumed. Unlike the commonly adopted water-filling approach where continuous bit loading is used, we consider assigning integer number of bits to subcarriers. We address the existence of pure Nash equilibrium (NE) of the static games for two-cell modulation adaptive and three-cell single modulation OFDMA systems. Theorems related to the existence of pure NE for the two games are developed. Using these results, we show that the existence of a stable solution for the OFDMA games cannot be guaranteed if minimum rate requirements must be satisfied. ©2009 IEEE.
Source Title: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
URI: http://scholarbank.nus.edu.sg/handle/10635/71234
ISBN: 9781424451234
DOI: 10.1109/PIMRC.2009.5450219
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

21
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.