Price-based joint beamforming and spectrum management in multi-antenna cognitive radio networks

Diep N. Nguyen, Marwan M Krunz

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We consider the problem of maximizing the throughput of a multi-antenna cognitive radio (CR) network. With spatial multiplexing over each frequency band, a multi-antenna CR node controls its antenna radiation directions and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one per band) at each CR node so that power and spectrum are optimally allocated for the node and its interference is steered away from unintended receivers. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. To tackle it, we translate it into a noncooperative game. We derive an optimal pricing policy for each node, which adapts to the node's neighboring conditions and drives the game to a Nash-Equilibrium (NE). The network throughput under this NE equals to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (best response), we develop a low-complexity distributed algorithm by exploiting the strong duality of the convex per-user optimization problem. The number of variables in the distributed algorithm is independent of the number of antenna elements. A centralized (cooperative) algorithm is also developed. Simulations show that the network throughput under the distributed algorithm rapidly converges to that of the centralized one. Finally, we develop a MAC protocol that implements our resource allocation and beamforming scheme. Extensive simulations show that the proposed protocol dramatically improves the network throughput and reduces power consumption.

Original languageEnglish (US)
Article number6354287
Pages (from-to)2295-2305
Number of pages11
JournalIEEE Journal on Selected Areas in Communications
Volume30
Issue number11
DOIs
StatePublished - 2012

Fingerprint

Cognitive radio
Beamforming
Throughput
Parallel algorithms
Antennas
Antenna radiation
Network protocols
Multiplexing
Frequency bands
Resource allocation
Electric power utilization
Costs

Keywords

  • beamforming
  • cognitive radio
  • frequency management
  • MIMO
  • Noncooperative game
  • power allocation
  • pricing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Price-based joint beamforming and spectrum management in multi-antenna cognitive radio networks. / Nguyen, Diep N.; Krunz, Marwan M.

In: IEEE Journal on Selected Areas in Communications, Vol. 30, No. 11, 6354287, 2012, p. 2295-2305.

Research output: Contribution to journalArticle

@article{acabb076868c4b74b929a0b23a654c4b,
title = "Price-based joint beamforming and spectrum management in multi-antenna cognitive radio networks",
abstract = "We consider the problem of maximizing the throughput of a multi-antenna cognitive radio (CR) network. With spatial multiplexing over each frequency band, a multi-antenna CR node controls its antenna radiation directions and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one per band) at each CR node so that power and spectrum are optimally allocated for the node and its interference is steered away from unintended receivers. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. To tackle it, we translate it into a noncooperative game. We derive an optimal pricing policy for each node, which adapts to the node's neighboring conditions and drives the game to a Nash-Equilibrium (NE). The network throughput under this NE equals to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (best response), we develop a low-complexity distributed algorithm by exploiting the strong duality of the convex per-user optimization problem. The number of variables in the distributed algorithm is independent of the number of antenna elements. A centralized (cooperative) algorithm is also developed. Simulations show that the network throughput under the distributed algorithm rapidly converges to that of the centralized one. Finally, we develop a MAC protocol that implements our resource allocation and beamforming scheme. Extensive simulations show that the proposed protocol dramatically improves the network throughput and reduces power consumption.",
keywords = "beamforming, cognitive radio, frequency management, MIMO, Noncooperative game, power allocation, pricing",
author = "Nguyen, {Diep N.} and Krunz, {Marwan M}",
year = "2012",
doi = "10.1109/JSAC.2012.121221",
language = "English (US)",
volume = "30",
pages = "2295--2305",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Price-based joint beamforming and spectrum management in multi-antenna cognitive radio networks

AU - Nguyen, Diep N.

AU - Krunz, Marwan M

PY - 2012

Y1 - 2012

N2 - We consider the problem of maximizing the throughput of a multi-antenna cognitive radio (CR) network. With spatial multiplexing over each frequency band, a multi-antenna CR node controls its antenna radiation directions and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one per band) at each CR node so that power and spectrum are optimally allocated for the node and its interference is steered away from unintended receivers. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. To tackle it, we translate it into a noncooperative game. We derive an optimal pricing policy for each node, which adapts to the node's neighboring conditions and drives the game to a Nash-Equilibrium (NE). The network throughput under this NE equals to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (best response), we develop a low-complexity distributed algorithm by exploiting the strong duality of the convex per-user optimization problem. The number of variables in the distributed algorithm is independent of the number of antenna elements. A centralized (cooperative) algorithm is also developed. Simulations show that the network throughput under the distributed algorithm rapidly converges to that of the centralized one. Finally, we develop a MAC protocol that implements our resource allocation and beamforming scheme. Extensive simulations show that the proposed protocol dramatically improves the network throughput and reduces power consumption.

AB - We consider the problem of maximizing the throughput of a multi-antenna cognitive radio (CR) network. With spatial multiplexing over each frequency band, a multi-antenna CR node controls its antenna radiation directions and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one per band) at each CR node so that power and spectrum are optimally allocated for the node and its interference is steered away from unintended receivers. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. To tackle it, we translate it into a noncooperative game. We derive an optimal pricing policy for each node, which adapts to the node's neighboring conditions and drives the game to a Nash-Equilibrium (NE). The network throughput under this NE equals to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (best response), we develop a low-complexity distributed algorithm by exploiting the strong duality of the convex per-user optimization problem. The number of variables in the distributed algorithm is independent of the number of antenna elements. A centralized (cooperative) algorithm is also developed. Simulations show that the network throughput under the distributed algorithm rapidly converges to that of the centralized one. Finally, we develop a MAC protocol that implements our resource allocation and beamforming scheme. Extensive simulations show that the proposed protocol dramatically improves the network throughput and reduces power consumption.

KW - beamforming

KW - cognitive radio

KW - frequency management

KW - MIMO

KW - Noncooperative game

KW - power allocation

KW - pricing

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

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

U2 - 10.1109/JSAC.2012.121221

DO - 10.1109/JSAC.2012.121221

M3 - Article

AN - SCOPUS:84870288464

VL - 30

SP - 2295

EP - 2305

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 11

M1 - 6354287

ER -