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

被引:30
作者
Abdel-Rahman, Mohammad J. [1 ]
Krunz, Marwan [2 ]
机构
[1] Univ Arizona, Tucson, AZ 85721 USA
[2] Univ Arizona, Dept Elect & Comp Engn, Tucson, AZ 85721 USA
基金
美国国家科学基金会;
关键词
Channel assignment; dynamic spectrum access; guard bands; multiple subset-sum problem; spectrum efficiency; stochastic optimization; RESOURCE-ALLOCATION; CARRIER AGGREGATION; SYSTEMS; CHUNK; POWER;
D O I
10.1109/TWC.2015.2413964
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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-sum problem (CSSP) and chance-constrained stochastic multiple subset-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.
引用
收藏
页码:3888 / 3898
页数:11
相关论文
共 25 条
[1]  
Abdel-Rahman MJ, 2013, IEEE GLOB COMM CONF, P1272, DOI 10.1109/GLOCOM.2013.6831249
[2]   Adjacent Channel Interference in 802.11a Is Harmful: Testbed Validation of a Simple Quantification Model [J].
Angelakis, Vangelis ;
Papadakis, Stefanos ;
Siris, Vasilios A. ;
Traganitis, Apostolos .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (03) :160-166
[3]  
[Anonymous], P IEEE GLOBECOM C DE
[4]  
[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations
[5]  
[Anonymous], P ECAI WORKSH ART IN
[6]   IEEE 802.11ac: From Channelization to Multi-User MIMO [J].
Bejarano, Oscar ;
Knightly, Edward W. ;
Park, Minyoung .
IEEE COMMUNICATIONS MAGAZINE, 2013, 51 (10) :84-90
[7]  
Cormen T., 2001, Introduction to Algorithms
[8]  
Deek L., 2011, CoNEXT
[9]   Intelligent Channel Bonding in 802.11n WLANs [J].
Deek, Lara ;
Garcia-Villegas, Eduard ;
Belding, Elizabeth ;
Lee, Sung-Ju ;
Almeroth, Kevin .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (06) :1242-1255
[10]  
Harrison K., 2010, NEW FRONTIERS DYNAMI, P1, DOI [10.1109/HICSS.2010.300, DOI 10.1109/DYSPAN.2010]