Power Allocation Games on Interference Channels with Complete and Partial Information

Chaitanya, Krishna A and Mukherji, Utpal and Sharma, Vinod (2015) Power Allocation Games on Interference Channels with Complete and Partial Information. In: 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), MAY 25-29, 2015, Mumbai, INDIA, pp. 70-77.

PDF WIOPT_70_2015.pdf - Published Version Restricted to Registered users only Download (186kB) | Request a copy

Abstract

We consider a Gaussian interference channel with independent direct and cross link channel gains, each of which is independent and identically distributed across time. Each transmitter-receiver user pair aims to maximize its long-term average transmission rate subject to an average power constraint. We formulate a stochastic game for this system in three different scenarios. First, we assume that each user knows all direct and cross link channel gains. Later, we assume that each user knows channel gains of only the links that are incident on its receiver. Lastly, we assume that each user knows only its own direct link channel gain. In all cases, we formulate the problem of finding the Nash equilibrium as a variational inequality (VI) problem and present a novel heuristic for solving the VI. We also present a lower bound on the utility for each user at any Nash equilibrium in the case of the games with partial information. We obtain this lower bound using a water-filling like power allocation that requires only knowledge of the distribution of a user's own channel gains and average power constraints of all users.

Item Type:	Conference Proceedings
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	08 Oct 2016 05:37
Last Modified:	08 Oct 2016 05:37
URI:	http://eprints.iisc.ac.in/id/eprint/54724

Actions (login required)

View Item