Spectrum management and power allocation in MIMO cognitive networks

Diep N. Nguyen, Marwan M Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

We consider the problem of maximizing the throughput of a multi-input multi-output (MIMO) cognitive radio (CR) network. CR users are assumed to share the available spectrum without disturbing primary radio (PR) transmissions. With spatial multiplexing performed over each frequency band, a multi-antenna CR node controls its antenna radiation patterns and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one for each band) at each CR node so that power and spectrum are optimally allocated for that node (in terms of throughput) and its interference is steered away from other CR and PR transmissions. In other words, the problems of power, spectrum and interference management are jointly investigated. We formulate a multi-carrier MIMO network throughput optimization problem subject to frequency-dependent power constraints. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. Such a problem is difficult to solve, even in a centralized manner. To tackle it, we translate it into a noncooperative game and 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 is at least equal to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (the best response), a low-complexity distributed algorithm is developed by exploiting the strong duality of the per-user convex 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, serving as a performance benchmark. Simulations show that the network throughput under the distributed algorithm converges rapidly to that of the centralized one. The fast convergence of the game facilitates MAC design, which we briefly discuss in the paper. The application of our results is not limited to CR systems, but extends to multi-carrier (e.g., OFDM) MIMO systems.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages2023-2031
Number of pages9
DOIs
StatePublished - 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Cognitive radio
Throughput
Parallel algorithms
Radio transmission
Antennas
Atmospheric spectra
Radio interference
Convex optimization
Radio systems
Directional patterns (antenna)
Power spectrum
Multiplexing
Orthogonal frequency division multiplexing
Frequency bands
Costs

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Spectrum management and power allocation in MIMO cognitive networks. / Nguyen, Diep N.; Krunz, Marwan M.

Proceedings - IEEE INFOCOM. 2012. p. 2023-2031 6195583.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nguyen, DN & Krunz, MM 2012, Spectrum management and power allocation in MIMO cognitive networks. in Proceedings - IEEE INFOCOM., 6195583, pp. 2023-2031, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195583
Nguyen, Diep N. ; Krunz, Marwan M. / Spectrum management and power allocation in MIMO cognitive networks. Proceedings - IEEE INFOCOM. 2012. pp. 2023-2031
@inproceedings{5e5d00d84b514768b7fbd9e69b6dea9b,
title = "Spectrum management and power allocation in MIMO cognitive networks",
abstract = "We consider the problem of maximizing the throughput of a multi-input multi-output (MIMO) cognitive radio (CR) network. CR users are assumed to share the available spectrum without disturbing primary radio (PR) transmissions. With spatial multiplexing performed over each frequency band, a multi-antenna CR node controls its antenna radiation patterns and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one for each band) at each CR node so that power and spectrum are optimally allocated for that node (in terms of throughput) and its interference is steered away from other CR and PR transmissions. In other words, the problems of power, spectrum and interference management are jointly investigated. We formulate a multi-carrier MIMO network throughput optimization problem subject to frequency-dependent power constraints. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. Such a problem is difficult to solve, even in a centralized manner. To tackle it, we translate it into a noncooperative game and 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 is at least equal to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (the best response), a low-complexity distributed algorithm is developed by exploiting the strong duality of the per-user convex 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, serving as a performance benchmark. Simulations show that the network throughput under the distributed algorithm converges rapidly to that of the centralized one. The fast convergence of the game facilitates MAC design, which we briefly discuss in the paper. The application of our results is not limited to CR systems, but extends to multi-carrier (e.g., OFDM) MIMO systems.",
keywords = "beamforming, cognitive radio, frequency management, MAC protocol, MIMO, Noncooperative game, power allocation, pricing",
author = "Nguyen, {Diep N.} and Krunz, {Marwan M}",
year = "2012",
doi = "10.1109/INFCOM.2012.6195583",
language = "English (US)",
isbn = "9781467307758",
pages = "2023--2031",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Spectrum management and power allocation in MIMO cognitive 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-input multi-output (MIMO) cognitive radio (CR) network. CR users are assumed to share the available spectrum without disturbing primary radio (PR) transmissions. With spatial multiplexing performed over each frequency band, a multi-antenna CR node controls its antenna radiation patterns and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one for each band) at each CR node so that power and spectrum are optimally allocated for that node (in terms of throughput) and its interference is steered away from other CR and PR transmissions. In other words, the problems of power, spectrum and interference management are jointly investigated. We formulate a multi-carrier MIMO network throughput optimization problem subject to frequency-dependent power constraints. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. Such a problem is difficult to solve, even in a centralized manner. To tackle it, we translate it into a noncooperative game and 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 is at least equal to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (the best response), a low-complexity distributed algorithm is developed by exploiting the strong duality of the per-user convex 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, serving as a performance benchmark. Simulations show that the network throughput under the distributed algorithm converges rapidly to that of the centralized one. The fast convergence of the game facilitates MAC design, which we briefly discuss in the paper. The application of our results is not limited to CR systems, but extends to multi-carrier (e.g., OFDM) MIMO systems.

AB - We consider the problem of maximizing the throughput of a multi-input multi-output (MIMO) cognitive radio (CR) network. CR users are assumed to share the available spectrum without disturbing primary radio (PR) transmissions. With spatial multiplexing performed over each frequency band, a multi-antenna CR node controls its antenna radiation patterns and allocates power for each data stream by appropriately adjusting its precoding matrix. Our objective is to design a set of precoding matrices (one for each band) at each CR node so that power and spectrum are optimally allocated for that node (in terms of throughput) and its interference is steered away from other CR and PR transmissions. In other words, the problems of power, spectrum and interference management are jointly investigated. We formulate a multi-carrier MIMO network throughput optimization problem subject to frequency-dependent power constraints. The problem is non-convex, with the number of variables growing quadratically with the number of antenna elements. Such a problem is difficult to solve, even in a centralized manner. To tackle it, we translate it into a noncooperative game and 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 is at least equal to that of a locally optimal solution of the non-convex centralized problem. To find the set of precoding matrices at each node (the best response), a low-complexity distributed algorithm is developed by exploiting the strong duality of the per-user convex 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, serving as a performance benchmark. Simulations show that the network throughput under the distributed algorithm converges rapidly to that of the centralized one. The fast convergence of the game facilitates MAC design, which we briefly discuss in the paper. The application of our results is not limited to CR systems, but extends to multi-carrier (e.g., OFDM) MIMO systems.

KW - beamforming

KW - cognitive radio

KW - frequency management

KW - MAC protocol

KW - MIMO

KW - Noncooperative game

KW - power allocation

KW - pricing

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

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

U2 - 10.1109/INFCOM.2012.6195583

DO - 10.1109/INFCOM.2012.6195583

M3 - Conference contribution

AN - SCOPUS:84861581887

SN - 9781467307758

SP - 2023

EP - 2031

BT - Proceedings - IEEE INFOCOM

ER -