Computer Science – Information Theory
Scientific paper
2010-11-06
Computer Science
Information Theory
accepted for publication in the IEEE Transactions on Vehicular Technology
Scientific paper
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 analyse 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 towards 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, this improvement in equilibrium efficiency is also observed in systems with a higher number of users.
Anandkumar Amod J. G.
Anandkumar Animashree
Chambers Jonathon A.
Lambotharan Sangarapillai
No associations
LandOfFree
Robust Rate-Maximization Game Under Bounded Channel Uncertainty does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Robust Rate-Maximization Game Under Bounded Channel Uncertainty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Rate-Maximization Game Under Bounded Channel Uncertainty will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-699789