Distributed power allocation in two-hop interference channels: An implicit-based approach

Yi Shi, Khaled Letaief, Ranjan K. Mallik, Xiaodai Dong

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The problem of distributed power allocation for an interference relay network is considered, where multiple source-relay-destination (S-R-D) links communicate concurrently in the same frequency and interfere over two hops, referred to as a two-hop interference channel. The direct source-destination connections are not considered in this work. Power allocation in this scenario is challenging as it necessitates not only performance tradeoff among multiple links but also power distribution for each link along spatial dimensions. We approach the problem from a game-theoretic perspective and propose a novel implicit-based approach to prove the uniqueness of the Nash equilibrium (NE). This technique complements the existing literature on equilibria analysis by revealing the benefits of expressing the best responses in implicit forms. To benchmark the performance of the NE, we have investigated the non-convex sum-utility maximization problem, and have 1) identified the optimal solution structures; 2) proved that linear pricing is locally optimal in maximizing the sum utilities. A simple and distributed pricing algorithm is then proposed. Simulation results show that for a two-user network, the proposed scheme closely approaches the optimal sum rate, while, for a ten-user network, the improvement is up to 340% compared to the non-cooperative game model without pricing.

Original languageEnglish
Article number6166332
Pages (from-to)1911-1921
Number of pages11
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number5
DOIs
Publication statusPublished - May 2012
Externally publishedYes

Fingerprint

Interference Channel
Power Allocation
Pricing
Nash Equilibrium
Equilibrium Analysis
Costs
Utility Maximization
Non-cooperative Game
Power Distribution
Relay Networks
Relay
Uniqueness
Complement
Optimal Solution
Trade-offs
Interference
Game
Benchmark
Scenarios
Simulation

Keywords

  • game theory
  • Implicit-based approach
  • multi-hop communications
  • Nash equilibrium
  • power allocation
  • two-hop interference channel

ASJC Scopus subject areas

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

Cite this

Distributed power allocation in two-hop interference channels : An implicit-based approach. / Shi, Yi; Letaief, Khaled; Mallik, Ranjan K.; Dong, Xiaodai.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 5, 6166332, 05.2012, p. 1911-1921.

Research output: Contribution to journalArticle

@article{f6dca23bf4e841a0af7db8c8719c2ec9,
title = "Distributed power allocation in two-hop interference channels: An implicit-based approach",
abstract = "The problem of distributed power allocation for an interference relay network is considered, where multiple source-relay-destination (S-R-D) links communicate concurrently in the same frequency and interfere over two hops, referred to as a two-hop interference channel. The direct source-destination connections are not considered in this work. Power allocation in this scenario is challenging as it necessitates not only performance tradeoff among multiple links but also power distribution for each link along spatial dimensions. We approach the problem from a game-theoretic perspective and propose a novel implicit-based approach to prove the uniqueness of the Nash equilibrium (NE). This technique complements the existing literature on equilibria analysis by revealing the benefits of expressing the best responses in implicit forms. To benchmark the performance of the NE, we have investigated the non-convex sum-utility maximization problem, and have 1) identified the optimal solution structures; 2) proved that linear pricing is locally optimal in maximizing the sum utilities. A simple and distributed pricing algorithm is then proposed. Simulation results show that for a two-user network, the proposed scheme closely approaches the optimal sum rate, while, for a ten-user network, the improvement is up to 340{\%} compared to the non-cooperative game model without pricing.",
keywords = "game theory, Implicit-based approach, multi-hop communications, Nash equilibrium, power allocation, two-hop interference channel",
author = "Yi Shi and Khaled Letaief and Mallik, {Ranjan K.} and Xiaodai Dong",
year = "2012",
month = "5",
doi = "10.1109/TWC.2012.030512.111427",
language = "English",
volume = "11",
pages = "1911--1921",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Distributed power allocation in two-hop interference channels

T2 - An implicit-based approach

AU - Shi, Yi

AU - Letaief, Khaled

AU - Mallik, Ranjan K.

AU - Dong, Xiaodai

PY - 2012/5

Y1 - 2012/5

N2 - The problem of distributed power allocation for an interference relay network is considered, where multiple source-relay-destination (S-R-D) links communicate concurrently in the same frequency and interfere over two hops, referred to as a two-hop interference channel. The direct source-destination connections are not considered in this work. Power allocation in this scenario is challenging as it necessitates not only performance tradeoff among multiple links but also power distribution for each link along spatial dimensions. We approach the problem from a game-theoretic perspective and propose a novel implicit-based approach to prove the uniqueness of the Nash equilibrium (NE). This technique complements the existing literature on equilibria analysis by revealing the benefits of expressing the best responses in implicit forms. To benchmark the performance of the NE, we have investigated the non-convex sum-utility maximization problem, and have 1) identified the optimal solution structures; 2) proved that linear pricing is locally optimal in maximizing the sum utilities. A simple and distributed pricing algorithm is then proposed. Simulation results show that for a two-user network, the proposed scheme closely approaches the optimal sum rate, while, for a ten-user network, the improvement is up to 340% compared to the non-cooperative game model without pricing.

AB - The problem of distributed power allocation for an interference relay network is considered, where multiple source-relay-destination (S-R-D) links communicate concurrently in the same frequency and interfere over two hops, referred to as a two-hop interference channel. The direct source-destination connections are not considered in this work. Power allocation in this scenario is challenging as it necessitates not only performance tradeoff among multiple links but also power distribution for each link along spatial dimensions. We approach the problem from a game-theoretic perspective and propose a novel implicit-based approach to prove the uniqueness of the Nash equilibrium (NE). This technique complements the existing literature on equilibria analysis by revealing the benefits of expressing the best responses in implicit forms. To benchmark the performance of the NE, we have investigated the non-convex sum-utility maximization problem, and have 1) identified the optimal solution structures; 2) proved that linear pricing is locally optimal in maximizing the sum utilities. A simple and distributed pricing algorithm is then proposed. Simulation results show that for a two-user network, the proposed scheme closely approaches the optimal sum rate, while, for a ten-user network, the improvement is up to 340% compared to the non-cooperative game model without pricing.

KW - game theory

KW - Implicit-based approach

KW - multi-hop communications

KW - Nash equilibrium

KW - power allocation

KW - two-hop interference channel

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

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

U2 - 10.1109/TWC.2012.030512.111427

DO - 10.1109/TWC.2012.030512.111427

M3 - Article

AN - SCOPUS:84861456817

VL - 11

SP - 1911

EP - 1921

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 5

M1 - 6166332

ER -