Spectrum-efficient stochastic channel assignment for opportunistic networks

The uncertainty in channel quality due to fading and shadowing along with the unpredictability of primary user (PU) activity make channel assignment in opportunistic spectrum access (OSA) networks quite challenging. In this paper, we propose two per-link channel assignment models under channel uncertainty: a static single-stage and an adaptive two-stage. In the static model, channel assignment is performed once, such that the rate demands are met with a probability greater than a certain threshold. This model is appropriate for a distributed network with no centralized spectrum manager. The adaptive model is a two-stage assignment model, where the initial assignment may be corrected once the uncertainties are partially revealed, such that the excess spectrum is returned back to the spectrum manager. This adaptive model is more appropriate when a centralized spectrum manager is available. Our channel assignment algorithms account for adjacent channel interference (ACI) by introducing guard-bands between adjacent channels that are assigned to different links. These algorithms aim at maximizing the spectral efficiency, considering the impact of guard-bands. The static ACI-aware channel assignment problem is formulated as a chance-constrained stochastic subset-sum problem (CSSP), and the adaptive assignment problem is formulated as a two-stage chance-constrained stochastic subset-sum problem with recourse (CSSPR). We develop heuristic algorithms for both models and test their performance. Preliminary results demonstrate that the proposed heuristic algorithms are highly efficient.

[1]  Marwan Krunz,et al.  Optimal guard-band-aware channel assignment with bonding and aggregation in multi-channel systems , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[2]  Vangelis Angelakis,et al.  Adjacent channel interference in 802.11a is harmful: Testbed validation of a simple quantification model , 2011, IEEE Communications Magazine.

[3]  B. Caron,et al.  Comparison of terrestrial DTV transmission systems: the ATSC 8-VSB, the DVB-T COFDM, and the ISDB-T BST-OFDM , 2000 .

[4]  Abdel Lisser,et al.  Stochastic Quadratic Knapsack with Recourse , 2010, Electron. Notes Discret. Math..

[5]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[6]  Abdel Lisser,et al.  On two-stage stochastic knapsack problems , 2011, Discret. Appl. Math..

[7]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[8]  Matemática Markov's Inequality , 2010 .

[9]  Kate Harrison,et al.  How Much White-Space Capacity Is There? , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

[10]  Abdel Lisser,et al.  Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm , 2010, Ann. Oper. Res..

[11]  Hsiao-Hwa Chen,et al.  IEEE 802.11n MAC frame aggregation mechanisms for next-generation high-throughput WLANs , 2008, IEEE Wireless Communications.

[12]  Marwan Krunz,et al.  An Efficient Guard-Band-Aware Multi-Channel Spectrum Sharing Mechanism for Dynamic Access Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[13]  R. Wets,et al.  Stochastic programming , 1989 .