Stochastic Guard-Band-Aware Channel Assignment With Bonding and Aggregation for DSA Networks

Mohammad J. Abdel-Rahman, Marwan M Krunz

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Fading and shadowing along with the primary user dynamics make channel quality in dynamic spectrum access networks uncertain. Furthermore, the imperfect design of filters and amplifiers in wireless devices motivates the need for guard-bands (GBs) to prevent adjacent-channel interference. In this paper, we develop novel stochastic GB-aware sequential and batch channel assignment schemes that aim at maximizing the spectrum efficiency. In line with recent IEEE 802.11 and LTE standards, our schemes support bonding and aggregation. We propose two assignment models for each of the sequential and batch schemes: a static single-stage and an adaptive two-stage. In the static model, channel assignment is performed once such that the rate demands are probabilistically met. The adaptive model is a two-stage model, where the initial assignment may be corrected once uncertainties are partially revealed. We refer to our formulations of the sequential and batch static assignments as chance-constrained stochastic subset-s um problem (CSSP) and chance-constrained stochastic multiple s ubset-sum problem (CMSSP), respectively. Moreover, we develop stochastic formulations for the sequential and batch adaptive assignments, which we refer to as two-stage CSSP with recourse (CSSPR) and two-stage CMSSP with recourse (CMSSPR), respectively. Finally, we present computationally efficient simplified versions of CSSP and CSSPR with near-optimal performance.

Original languageEnglish (US)
Article number7066976
Pages (from-to)3888-3898
Number of pages11
JournalIEEE Transactions on Wireless Communications
Volume14
Issue number7
DOIs
StatePublished - Jul 1 2015

Fingerprint

Channel Assignment
Aggregation
Agglomeration
Batch
Assignment
Subset
Dynamic Spectrum Access
Two-stage Model
Interference Channel
Formulation
Shadowing
IEEE 802.11
Fading
Imperfect
Adjacent
Model
Filter
Uncertainty
Line

Keywords

  • Channel assignment
  • dynamic spectrum access
  • guard bands
  • multiple subset-sum problem
  • spectrum efficiency
  • stochastic optimization

ASJC Scopus subject areas

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

Cite this

Stochastic Guard-Band-Aware Channel Assignment With Bonding and Aggregation for DSA Networks. / Abdel-Rahman, Mohammad J.; Krunz, Marwan M.

In: IEEE Transactions on Wireless Communications, Vol. 14, No. 7, 7066976, 01.07.2015, p. 3888-3898.

Research output: Contribution to journalArticle

@article{77c7658144f349c080b8e650de7f17ad,
title = "Stochastic Guard-Band-Aware Channel Assignment With Bonding and Aggregation for DSA Networks",
abstract = "Fading and shadowing along with the primary user dynamics make channel quality in dynamic spectrum access networks uncertain. Furthermore, the imperfect design of filters and amplifiers in wireless devices motivates the need for guard-bands (GBs) to prevent adjacent-channel interference. In this paper, we develop novel stochastic GB-aware sequential and batch channel assignment schemes that aim at maximizing the spectrum efficiency. In line with recent IEEE 802.11 and LTE standards, our schemes support bonding and aggregation. We propose two assignment models for each of the sequential and batch schemes: a static single-stage and an adaptive two-stage. In the static model, channel assignment is performed once such that the rate demands are probabilistically met. The adaptive model is a two-stage model, where the initial assignment may be corrected once uncertainties are partially revealed. We refer to our formulations of the sequential and batch static assignments as chance-constrained stochastic subset-s um problem (CSSP) and chance-constrained stochastic multiple s ubset-sum problem (CMSSP), respectively. Moreover, we develop stochastic formulations for the sequential and batch adaptive assignments, which we refer to as two-stage CSSP with recourse (CSSPR) and two-stage CMSSP with recourse (CMSSPR), respectively. Finally, we present computationally efficient simplified versions of CSSP and CSSPR with near-optimal performance.",
keywords = "Channel assignment, dynamic spectrum access, guard bands, multiple subset-sum problem, spectrum efficiency, stochastic optimization",
author = "Abdel-Rahman, {Mohammad J.} and Krunz, {Marwan M}",
year = "2015",
month = "7",
day = "1",
doi = "10.1109/TWC.2015.2413964",
language = "English (US)",
volume = "14",
pages = "3888--3898",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Stochastic Guard-Band-Aware Channel Assignment With Bonding and Aggregation for DSA Networks

AU - Abdel-Rahman, Mohammad J.

AU - Krunz, Marwan M

PY - 2015/7/1

Y1 - 2015/7/1

N2 - Fading and shadowing along with the primary user dynamics make channel quality in dynamic spectrum access networks uncertain. Furthermore, the imperfect design of filters and amplifiers in wireless devices motivates the need for guard-bands (GBs) to prevent adjacent-channel interference. In this paper, we develop novel stochastic GB-aware sequential and batch channel assignment schemes that aim at maximizing the spectrum efficiency. In line with recent IEEE 802.11 and LTE standards, our schemes support bonding and aggregation. We propose two assignment models for each of the sequential and batch schemes: a static single-stage and an adaptive two-stage. In the static model, channel assignment is performed once such that the rate demands are probabilistically met. The adaptive model is a two-stage model, where the initial assignment may be corrected once uncertainties are partially revealed. We refer to our formulations of the sequential and batch static assignments as chance-constrained stochastic subset-s um problem (CSSP) and chance-constrained stochastic multiple s ubset-sum problem (CMSSP), respectively. Moreover, we develop stochastic formulations for the sequential and batch adaptive assignments, which we refer to as two-stage CSSP with recourse (CSSPR) and two-stage CMSSP with recourse (CMSSPR), respectively. Finally, we present computationally efficient simplified versions of CSSP and CSSPR with near-optimal performance.

AB - Fading and shadowing along with the primary user dynamics make channel quality in dynamic spectrum access networks uncertain. Furthermore, the imperfect design of filters and amplifiers in wireless devices motivates the need for guard-bands (GBs) to prevent adjacent-channel interference. In this paper, we develop novel stochastic GB-aware sequential and batch channel assignment schemes that aim at maximizing the spectrum efficiency. In line with recent IEEE 802.11 and LTE standards, our schemes support bonding and aggregation. We propose two assignment models for each of the sequential and batch schemes: a static single-stage and an adaptive two-stage. In the static model, channel assignment is performed once such that the rate demands are probabilistically met. The adaptive model is a two-stage model, where the initial assignment may be corrected once uncertainties are partially revealed. We refer to our formulations of the sequential and batch static assignments as chance-constrained stochastic subset-s um problem (CSSP) and chance-constrained stochastic multiple s ubset-sum problem (CMSSP), respectively. Moreover, we develop stochastic formulations for the sequential and batch adaptive assignments, which we refer to as two-stage CSSP with recourse (CSSPR) and two-stage CMSSP with recourse (CMSSPR), respectively. Finally, we present computationally efficient simplified versions of CSSP and CSSPR with near-optimal performance.

KW - Channel assignment

KW - dynamic spectrum access

KW - guard bands

KW - multiple subset-sum problem

KW - spectrum efficiency

KW - stochastic optimization

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

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

U2 - 10.1109/TWC.2015.2413964

DO - 10.1109/TWC.2015.2413964

M3 - Article

VL - 14

SP - 3888

EP - 3898

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 7

M1 - 7066976

ER -