Amod_Final_Manuscript.pdf (840.55 kB)

Robust rate maximization game under bounded channel uncertainty

Download (840.55 kB)
journal contribution
posted on 28.03.2012 by Amod J.G. Anandkumar, Animashree Anandkumar, Sangarapillai Lambotharan, Jonathon Chambers
We consider the problem of decentralized power allocation for competitive rate maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the rate maximization game. We present the robust optimization equilibrium for this game and derive sufficient conditions for its existence and uniqueness. We show that an iterative waterfilling algorithm converges to this equilibrium under certain sufficient conditions. We analyze the social properties of the equilibrium under varying channel uncertainty bounds for the two-user case. We also observe an interesting phenomenon that the equilibrium moves toward a frequency-division multiple-access solution for any set of channel coefficients under increasing channel uncertainty bounds. We further prove that increasing channel uncertainty can lead to a more efficient equilibrium and, hence, a better sum rate in certain two-user communication systems. Finally, we confirm, through simulations, that this improvement in equilibrium efficiency is also observed in systems with a higher number of users.

History

School

  • Mechanical, Electrical and Manufacturing Engineering

Citation

ANANDKUMAR, A.J.G., 2011. Robust rate maximization game under bounded channel uncertainty. IEEE Transactions on Vehicular Technology, 60 (9), pp. 4471 - 4486

Publisher

© IEEE

Version

AM (Accepted Manuscript)

Publication date

2011

Notes

(c) 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, 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 components of this work in other works.

ISSN

0018-9545

Language

en

Exports