Abstract / truncated to 115 words (read the full abstract)

The predominant game-theoretic solutions for distributed rate-maximization algorithms in Gaussian interference channels through optimal power control require perfect channel knowledge, which is not possible in practice due to various reasons, such as estimation errors, feedback quantization and latency between channel estimation and signal transmission. This thesis therefore aims at addressing this issue through the design and analysis of robust game-theoretic algorithms for rate-maximization in Gaussian interference channels in the presence of bounded channel uncertainty. A robust rate-maximization game is formulated for the single-antenna frequency-selective Gaussian interference channel under bounded channel uncertainty. The robust-optimization equilibrium solution for this game is independent of the probability distribution of the channel uncertainty. The existence and uniqueness of the equilibrium ... toggle 9 keywords

wireless communications game theory resource allocation distributed algorithms nash equilibrium robust games waterfilling algorithms orthogonal frequency division multiplexing (ofdm) multiple-input multiple output (mimo)


Anandkumar, Amod Jai Ganesh
Loughborough University
Publication Year
Upload Date
Aug. 19, 2011

First few pages / click to enlarge

The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.

The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.