A game-theoretic approach for distributed power control in interference relay channels

Yi Shi, Jiaheng Wang, Khaled Letaief, Ranjan K. Mallik

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.

Original languageEnglish
Article number5089996
Pages (from-to)3151-3161
Number of pages11
JournalIEEE Transactions on Wireless Communications
Volume8
Issue number6
DOIs
Publication statusPublished - Jun 2009
Externally publishedYes

Fingerprint

Relay Channel
Distributed Control
Power Control
Power control
Interference
Game
Nash Equilibrium
Relay
Asynchronous Algorithms
Pareto Optimality
Sufficient Conditions
Distributed Algorithms
Decentralized
Control Strategy
Control Problem
Optimal Control
Uniqueness
Converge
Arbitrary

Keywords

  • Distributed algorithm
  • Game theory
  • Interference relay channels
  • Pareto-optimality
  • Power control

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

A game-theoretic approach for distributed power control in interference relay channels. / Shi, Yi; Wang, Jiaheng; Letaief, Khaled; Mallik, Ranjan K.

In: IEEE Transactions on Wireless Communications, Vol. 8, No. 6, 5089996, 06.2009, p. 3151-3161.

Research output: Contribution to journalArticle

@article{42b4b5991aa441cf91a303eca0548b13,
title = "A game-theoretic approach for distributed power control in interference relay channels",
abstract = "This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.",
keywords = "Distributed algorithm, Game theory, Interference relay channels, Pareto-optimality, Power control",
author = "Yi Shi and Jiaheng Wang and Khaled Letaief and Mallik, {Ranjan K.}",
year = "2009",
month = "6",
doi = "10.1109/TWC.2009.080831",
language = "English",
volume = "8",
pages = "3151--3161",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A game-theoretic approach for distributed power control in interference relay channels

AU - Shi, Yi

AU - Wang, Jiaheng

AU - Letaief, Khaled

AU - Mallik, Ranjan K.

PY - 2009/6

Y1 - 2009/6

N2 - This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.

AB - This paper considers the multiuser power control problem in Gaussian frequency-flat interference relay channels using a game-theoretic framework. While a lot of attention has been paid to Gaussian interference games, where sufficient conditions for the uniqueness of the Nash equilibrium (NE) have been established, these types of games have not been studied in the context of interference relay channels. We consider here Gaussian interference relay games (GIRGs), where instead of allocating the power budget across a set of sub-channels, each player aims to decide the optimal power control strategy across a set of hops. We show that the GIRG always possesses a unique NE for a two-player version of the game, irrespective of any channel realization or initial system parameters such as power budgets and noise power. Furthermore, we derive explicitly a sufficient condition under which the NE achieves Pareto-optimality. To facilitate decentralized implementation, we propose a distributed and asynchronous algorithm. We also prove that the proposed algorithm always converges to the unique NE from an arbitrary starting point. We then conclude that the distributed game-theoretic approach exhibits great potential in the context of interference relay channels and qualifies as a practically appealing candidate for power control.

KW - Distributed algorithm

KW - Game theory

KW - Interference relay channels

KW - Pareto-optimality

KW - Power control

UR - http://www.scopus.com/inward/record.url?scp=67651177706&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67651177706&partnerID=8YFLogxK

U2 - 10.1109/TWC.2009.080831

DO - 10.1109/TWC.2009.080831

M3 - Article

VL - 8

SP - 3151

EP - 3161

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 6

M1 - 5089996

ER -