Please use this identifier to cite or link to this item:
|Title:||On the modeling of a non-cooperative multicell OFDMA resource allocation game with integer bit-loading|
|Keywords:||Bit and power allocation|
|Source:||Liang, Z.,Chew, Y.H.,Ko, C.C. (2009). On the modeling of a non-cooperative multicell OFDMA resource allocation game with integer bit-loading. GLOBECOM - IEEE Global Telecommunications Conference : -. ScholarBank@NUS Repository. https://doi.org/10.1109/GLOCOM.2009.5425878|
|Abstract:||We address the adaptive allocation of subcarrier, bit and power resources among the base stations (BSs) of a down-link multi-cell OFDMA system using the non-cooperative game theoretic approach. Unlike the information theoretic approach where continuous bit-loading is used, our algorithm allocates integer number of bits to each subcarrier. Using a utility function with linear pricing on both the transmit bit rate and power, we first show that for a simple two-cell system with single user and fixed modulation, a Nash equilibrium (NE) solution always exists. However, for games formulated on more complicated systems such as with more than two cells, with more than one user in a cell, or when adaptive modulation is used, we observed that the existence of NE cannot be guaranteed. If NE points exist, the game can be played repeatedly with each BS (the player) selects its best strategy until the solution converges, or known as the myopic game. Based on the framework of potential games with coupled constraints, we propose an algorithm which can achieve a stable solution among the players despite that NE solution to the originally problem does not necessarily exist. The convergence of the proposed algorithm is verified by simulation.|
|Source Title:||GLOBECOM - IEEE Global Telecommunications Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.