Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 54, Issue 8, Pages 3471-3489Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2008.926399
Keywords
game theory; Gaussian parallel interference channel; generalized Nash equilibrium (NE); iterative water-filling algorithm; mutual information; spectrum sharing
Funding
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0802022] Funding Source: National Science Foundation
Ask authors/readers for more resources
This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium (NE) game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the solution set to our problem. Then, to compute the solutions of the game, we propose two distributed algorithms based on the single user water-filling solution: The sequential and the simultaneous iterative water-filling algorithms, wherein the users update their own strategies sequentially and simultaneously, respectively. We derive a unified set of sufficient conditions that guarantee the uniqueness of the solution and global convergence of both algorithms. Our results are applicable to all practical distributed multipoint-to-multipoint interference systems, either wired or wireless, where a quality of service in (QoS) terms of information rate must be guaranteed for each link.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available