Cart (Loading....) | Create Account
Close category search window

On the Modeling of a Non-Cooperative Multicell OFDMA Resource Allocation Game with Integer Bit-Loading

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhenyu Liang ; Inst. for Infocomm Res., Agency for Sci., Technol. & Res., Singapore, Singapore ; Chew, Y.H. ; Chi Chung Ko

We address the adaptive allocation of subcarrier, bit and power resources among the base stations (BSs) of a downlink 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.

Published in:

Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE

Date of Conference:

Nov. 30 2009-Dec. 4 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.