Optimal guard-band-aware channel assignment with bonding and aggregation in multi-channel systems

Uyanık, Gülnur Selda; Abdel-Rahman, Mohammad J.; Krunz, Marwan

doi:10.1109/glocomw.2013.6855705

Cited by 14 publications

(23 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The requirements of guard-bands may be different due to various physical layer techniques employed for CA [30]. As elaborated in [8], [10], optimization on channel utilization can also be carried out when guard-bands are considered for CA. The variety of sub-channels and guard-bands may result in heterogeneity in channel parameters before or after CF and CA.…”

Section: Su Channel Access Strategymentioning

confidence: 99%

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

Jiao

Balapuwaduge

et al. 2014

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Flexible channel allocation may be applied to multichannel cognitive radio networks (CRNs) through either channel assembling (CA) or channel fragmentation (CF). While CA allows one secondary user (SU) occupy multiple channels when primary users (PUs) are absent, CF provides finer granularity for channel occupancy by allocating a portion of one channel to an SU flow. In this paper, we investigate the impact of CF together with CA for SU flows by proposing a channel access strategy which activates both CF and CA and correspondingly evaluating its performance. In addition, we also consider a novel scenario where CA is enabled for PU flows. The performance evaluation is conducted based on continuous time Markov chain (CTMC) modeling and simulations. Through mathematical analyses and simulation results, we demonstrate that higher system capacity can be achieved indeed by jointly employing both CA and CF, in comparison with the CA-only strategies. However, this benefit is obtained only under certain conditions which are pointed out in this paper. Furthermore, the theoretical capacity upper bound for SU flows with both CF and CA enabled is derived when PU activities are relatively static compared with SU flows.

show abstract

Section: Su Channel Access Strategymentioning

confidence: 99%

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

Jiao

Balapuwaduge

et al. 2014

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…In contrast to [17] and [18], we consider the same problem for scenarios where channel selections are made autonomously and adaptively by each user. In our setup, there is no centralized entity that can perform optimize channel/bonding selections.…”

Section: Related Literaturementioning

confidence: 99%

“…In our setup, there is no centralized entity that can perform optimize channel/bonding selections. Moreover, unlike [17] and [18] where only collision-protocol model was considered, in our work we also consider the SINR-protocol model. In [3], a measurement-based framework was presented to investigate CB in unlicensed channels.…”

Section: Related Literaturementioning

confidence: 99%

See 1 more Smart Citation

Distributed and Coordinated Spectrum Access Methods for Heterogeneous Channel Bonding

Khan

Lehtomäki

Scott

et al. 2017

IEEE Trans. Cogn. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

Channel bonding (CB) is a technique that enables a wireless link to combine channels and achieve higher data rates. In this paper, competition for efficient spectrum access among autonomous users with heterogeneous CB capabilities is considered. Specifically, we propose distributed and coordinated channel/bonding selection methods under signal-to-interference-plus-noise ratio (SINR) and collisionprotocol models. In our methods, users utilize only limited feedback to distributively arrive at CB selections that minimize their probability of conflict. The proposed method utilizes a novel channel quality metric, which is based on the ratio of noise power to the sum of interference and noise power. It is shown that CB can lead to higher data rates, and it is most beneficial when users have a high SINR. However, it is also shown that as the ratio of users to available channels increases, CB performance degrades. Our results show that under certain scenarios, the proposed coordinated and distributed channel/bonding selection schemes help users converge fast to conflict-free channel selections as compared to the other channel/bonding selection schemes. Moreover, the proposed schemes result in considerably superior performance to existing CB schemes in terms of network data rate.

show abstract

“…The GBA channel assignment mechanisms in [5] do not necessarily result in the optimal spectrum efficiency (i.e., minimum number of newly introduced guard bands). Adopting the guard-band reuse model, an optimal spectrum-efficient GBA channel assignment mechanism was proposed in [6]. The channel assignment mechanism in [6] was formulated as a subset-sum problem (SSP) [7], assuming that the maximum transmission rates supported by various channels are deterministic.…”

Section: Introductionmentioning

confidence: 99%

Spectrum-efficient stochastic channel assignment for opportunistic networks

Abdel-Rahman

Lan

Krunz

2013

2013 IEEE Global Communications Conference (GLOBECOM)

Self Cite

View full text Add to dashboard Cite

Abstract-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.

show abstract

Optimal guard-band-aware channel assignment with bonding and aggregation in multi-channel systems

Cited by 14 publications

References 11 publications

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

Distributed and Coordinated Spectrum Access Methods for Heterogeneous Channel Bonding

Spectrum-efficient stochastic channel assignment for opportunistic networks

Contact Info

Product

Resources

About