Power minimization in MIMO cognitive networks using beamforming games

Diep N. Nguyen, Marwan M Krunz

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

We consider a multi-channel multi-user cognitive radio MIMO network in which each node controls its antenna radiation directions and allocates power for each data stream by adjusting its precoding matrices. Under a noncooperative game, we optimize the set of precoding matrices (one per channel) at each node so as to minimize the total transmit power in the network. Using recession analysis and the theory of variational inequalities, we obtain sufficient conditions that guarantee the existence and uniqueness of the game's Nash Equilibrium (NE). Low-complexity distributed algorithms are also developed by exploiting the strong duality of the convex per-user optimization problem. To improve the efficiency of the NE, we introduce pricing policies that employ a novel network interference function. Existence and uniqueness of the new NE under pricing are studied. Simulations confirm the effectiveness of our joint optimization approach.

Original languageEnglish (US)
Article number6502486
Pages (from-to)916-925
Number of pages10
JournalIEEE Journal on Selected Areas in Communications
Volume31
Issue number5
DOIs
StatePublished - 2013

Fingerprint

Beamforming
MIMO systems
Antenna radiation
Cognitive radio
Parallel algorithms
Costs

Keywords

  • beamforming
  • cognitive radio
  • MIMO
  • noncooperative game
  • Power/spectrum efficiency
  • pricing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Power minimization in MIMO cognitive networks using beamforming games. / Nguyen, Diep N.; Krunz, Marwan M.

In: IEEE Journal on Selected Areas in Communications, Vol. 31, No. 5, 6502486, 2013, p. 916-925.

Research output: Contribution to journalArticle

@article{9da475166ae34dcfba6eafc107940944,
title = "Power minimization in MIMO cognitive networks using beamforming games",
abstract = "We consider a multi-channel multi-user cognitive radio MIMO network in which each node controls its antenna radiation directions and allocates power for each data stream by adjusting its precoding matrices. Under a noncooperative game, we optimize the set of precoding matrices (one per channel) at each node so as to minimize the total transmit power in the network. Using recession analysis and the theory of variational inequalities, we obtain sufficient conditions that guarantee the existence and uniqueness of the game's Nash Equilibrium (NE). Low-complexity distributed algorithms are also developed by exploiting the strong duality of the convex per-user optimization problem. To improve the efficiency of the NE, we introduce pricing policies that employ a novel network interference function. Existence and uniqueness of the new NE under pricing are studied. Simulations confirm the effectiveness of our joint optimization approach.",
keywords = "beamforming, cognitive radio, MIMO, noncooperative game, Power/spectrum efficiency, pricing",
author = "Nguyen, {Diep N.} and Krunz, {Marwan M}",
year = "2013",
doi = "10.1109/JSAC.2013.130510",
language = "English (US)",
volume = "31",
pages = "916--925",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Power minimization in MIMO cognitive networks using beamforming games

AU - Nguyen, Diep N.

AU - Krunz, Marwan M

PY - 2013

Y1 - 2013

N2 - We consider a multi-channel multi-user cognitive radio MIMO network in which each node controls its antenna radiation directions and allocates power for each data stream by adjusting its precoding matrices. Under a noncooperative game, we optimize the set of precoding matrices (one per channel) at each node so as to minimize the total transmit power in the network. Using recession analysis and the theory of variational inequalities, we obtain sufficient conditions that guarantee the existence and uniqueness of the game's Nash Equilibrium (NE). Low-complexity distributed algorithms are also developed by exploiting the strong duality of the convex per-user optimization problem. To improve the efficiency of the NE, we introduce pricing policies that employ a novel network interference function. Existence and uniqueness of the new NE under pricing are studied. Simulations confirm the effectiveness of our joint optimization approach.

AB - We consider a multi-channel multi-user cognitive radio MIMO network in which each node controls its antenna radiation directions and allocates power for each data stream by adjusting its precoding matrices. Under a noncooperative game, we optimize the set of precoding matrices (one per channel) at each node so as to minimize the total transmit power in the network. Using recession analysis and the theory of variational inequalities, we obtain sufficient conditions that guarantee the existence and uniqueness of the game's Nash Equilibrium (NE). Low-complexity distributed algorithms are also developed by exploiting the strong duality of the convex per-user optimization problem. To improve the efficiency of the NE, we introduce pricing policies that employ a novel network interference function. Existence and uniqueness of the new NE under pricing are studied. Simulations confirm the effectiveness of our joint optimization approach.

KW - beamforming

KW - cognitive radio

KW - MIMO

KW - noncooperative game

KW - Power/spectrum efficiency

KW - pricing

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

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

U2 - 10.1109/JSAC.2013.130510

DO - 10.1109/JSAC.2013.130510

M3 - Article

AN - SCOPUS:84876746684

VL - 31

SP - 916

EP - 925

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 5

M1 - 6502486

ER -