Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 2010 | Published
Book Section - Chapter Open

Efficiency of rate-maximization game under bounded channel uncertainty

Abstract

The problem of competitive rate-maximization is an important signal-processing problem for power-constrained multi-user systems. It involves solving the power control problem for mutually interfering users operating across multiple frequencies. We introduced robust rate-maximization game for systems with bounded channel uncertainty. In this paper, we analyse the effect of uncertainty on the global efficiency of the robust rate-maximization game. For a two-user scenario with large number of frequencies, we show that the robust-optimization equilibrium tends to move towards FDMA solution as the uncertainty bound increases and thus increases the sum-rate for interference-constrained systems where FDMA is Pareto-optimal. These results are verified through simulations.

Additional Information

© 2010 IEEE.

Attached Files

Published - 05757605.pdf

Files

05757605.pdf
Files (244.2 kB)
Name Size Download all
md5:3516e31d82b155aa306ce5578887b36a
244.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023