Distributed Bargaining Mechanisms for MIMO Dynamic Spectrum Access Systems

Diep N. Nguyen, Marwan M Krunz, Stephen V. Hanly

Research output: Contribution to journalArticle

Abstract

Dynamic spectrum access (DSA) and MIMO communications are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum allocation and spatial/antenna pattern in a distributed fashion. Regardless of spectrum dynamics and heterogeneity, existing literature on channel/power allocation in MIMO DSA systems is only applicable to centralized cases. Our objective here is to design distributed algorithms that jointly allocate opportunistic channels to various links and to simultaneously optimize the MIMO precoding matrices so as to achieve fairness or maximize network throughput. For self-interested DSA links, our distributed algorithm allows links to negotiate channel allocation based on Nash bargaining (NB) and configure the precoding matrices so that links' rate demands are guaranteed while the surplus resources (after meeting minimum rate demands) are fairly allocated. Next, we consider a network throughput maximization formulation (NET-MAX). Both the NB-based and NET-MAX problems are combinatorial with mixed variables. To tackle them, we first transform the original problems by incorporating the concept of timesharing. Using dual decomposition, we develop optimal distributed algorithms for timesharing case, which shed light on how to derive a distributed algorithm for the original problems. Our work fills a gap in the literature of channel allocation where a central controller is not available.

Original languageEnglish (US)
Article number7312950
Pages (from-to)113-127
Number of pages15
JournalIEEE Transactions on Cognitive Communications and Networking
Volume1
Issue number1
DOIs
StatePublished - Mar 1 2015

Fingerprint

MIMO systems
Parallel algorithms
Throughput
Directional patterns (antenna)
Telecommunication traffic
Decomposition
Controllers
Communication

Keywords

  • cognitive radio
  • distributed algorithm
  • dual decomposition
  • fairness
  • MIMO precoding
  • Nash bargaining
  • rate demands
  • throughput maximization

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Distributed Bargaining Mechanisms for MIMO Dynamic Spectrum Access Systems. / Nguyen, Diep N.; Krunz, Marwan M; Hanly, Stephen V.

In: IEEE Transactions on Cognitive Communications and Networking, Vol. 1, No. 1, 7312950, 01.03.2015, p. 113-127.

Research output: Contribution to journalArticle

@article{0d4473e48d12480b9b41c2cf8becc8ae,
title = "Distributed Bargaining Mechanisms for MIMO Dynamic Spectrum Access Systems",
abstract = "Dynamic spectrum access (DSA) and MIMO communications are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum allocation and spatial/antenna pattern in a distributed fashion. Regardless of spectrum dynamics and heterogeneity, existing literature on channel/power allocation in MIMO DSA systems is only applicable to centralized cases. Our objective here is to design distributed algorithms that jointly allocate opportunistic channels to various links and to simultaneously optimize the MIMO precoding matrices so as to achieve fairness or maximize network throughput. For self-interested DSA links, our distributed algorithm allows links to negotiate channel allocation based on Nash bargaining (NB) and configure the precoding matrices so that links' rate demands are guaranteed while the surplus resources (after meeting minimum rate demands) are fairly allocated. Next, we consider a network throughput maximization formulation (NET-MAX). Both the NB-based and NET-MAX problems are combinatorial with mixed variables. To tackle them, we first transform the original problems by incorporating the concept of timesharing. Using dual decomposition, we develop optimal distributed algorithms for timesharing case, which shed light on how to derive a distributed algorithm for the original problems. Our work fills a gap in the literature of channel allocation where a central controller is not available.",
keywords = "cognitive radio, distributed algorithm, dual decomposition, fairness, MIMO precoding, Nash bargaining, rate demands, throughput maximization",
author = "Nguyen, {Diep N.} and Krunz, {Marwan M} and Hanly, {Stephen V.}",
year = "2015",
month = "3",
day = "1",
doi = "10.1109/TCCN.2015.2496317",
language = "English (US)",
volume = "1",
pages = "113--127",
journal = "IEEE Transactions on Cognitive Communications and Networking",
issn = "2332-7731",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Distributed Bargaining Mechanisms for MIMO Dynamic Spectrum Access Systems

AU - Nguyen, Diep N.

AU - Krunz, Marwan M

AU - Hanly, Stephen V.

PY - 2015/3/1

Y1 - 2015/3/1

N2 - Dynamic spectrum access (DSA) and MIMO communications are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum allocation and spatial/antenna pattern in a distributed fashion. Regardless of spectrum dynamics and heterogeneity, existing literature on channel/power allocation in MIMO DSA systems is only applicable to centralized cases. Our objective here is to design distributed algorithms that jointly allocate opportunistic channels to various links and to simultaneously optimize the MIMO precoding matrices so as to achieve fairness or maximize network throughput. For self-interested DSA links, our distributed algorithm allows links to negotiate channel allocation based on Nash bargaining (NB) and configure the precoding matrices so that links' rate demands are guaranteed while the surplus resources (after meeting minimum rate demands) are fairly allocated. Next, we consider a network throughput maximization formulation (NET-MAX). Both the NB-based and NET-MAX problems are combinatorial with mixed variables. To tackle them, we first transform the original problems by incorporating the concept of timesharing. Using dual decomposition, we develop optimal distributed algorithms for timesharing case, which shed light on how to derive a distributed algorithm for the original problems. Our work fills a gap in the literature of channel allocation where a central controller is not available.

AB - Dynamic spectrum access (DSA) and MIMO communications are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum allocation and spatial/antenna pattern in a distributed fashion. Regardless of spectrum dynamics and heterogeneity, existing literature on channel/power allocation in MIMO DSA systems is only applicable to centralized cases. Our objective here is to design distributed algorithms that jointly allocate opportunistic channels to various links and to simultaneously optimize the MIMO precoding matrices so as to achieve fairness or maximize network throughput. For self-interested DSA links, our distributed algorithm allows links to negotiate channel allocation based on Nash bargaining (NB) and configure the precoding matrices so that links' rate demands are guaranteed while the surplus resources (after meeting minimum rate demands) are fairly allocated. Next, we consider a network throughput maximization formulation (NET-MAX). Both the NB-based and NET-MAX problems are combinatorial with mixed variables. To tackle them, we first transform the original problems by incorporating the concept of timesharing. Using dual decomposition, we develop optimal distributed algorithms for timesharing case, which shed light on how to derive a distributed algorithm for the original problems. Our work fills a gap in the literature of channel allocation where a central controller is not available.

KW - cognitive radio

KW - distributed algorithm

KW - dual decomposition

KW - fairness

KW - MIMO precoding

KW - Nash bargaining

KW - rate demands

KW - throughput maximization

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

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

U2 - 10.1109/TCCN.2015.2496317

DO - 10.1109/TCCN.2015.2496317

M3 - Article

VL - 1

SP - 113

EP - 127

JO - IEEE Transactions on Cognitive Communications and Networking

JF - IEEE Transactions on Cognitive Communications and Networking

SN - 2332-7731

IS - 1

M1 - 7312950

ER -