A Fast Rendezvous-Guarantee Channel Hopping Protocol for Cognitive Radio Networks

Chao, Chih–Min; Fu, Hsiang-Yuan; Li-Ren, Zhang

doi:10.1109/tvt.2014.2387377

Cited by 41 publications

(12 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many CH-based rendezvous schemes have been proposed in the literature. [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] These schemes can be categorized in different ways, according to the adopted assumptions and mathematical construction tools. A detailed survey of the rendezvous issue in cognitive radio ad hoc networks (CRAHNs) and the different categories of the CH-based rendezvous schemes is well studied in the work of Joshi et al 24 However, most of the existing CH rendezvous designs were not tailored for fast PU dynamics, where channel availabilities can vary during the rendezvous operation itself.…”

Section: Motivationmentioning

confidence: 99%

“…The rendezvous occurs between a pair of communicating SUs when they hop during the same time slot over a channel that is commonly available for both of them. Many CH‐based rendezvous schemes have been proposed in the literature . These schemes can be categorized in different ways, according to the adopted assumptions and mathematical construction tools.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient rendezvous schemes for fast‐varying cognitive radio ad hoc networks

Al-Mqdashi

Sali

Abdel-Rahman

et al. 2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Rendezvous is a fundamental operation for establishing communications between cognitive radios in a cognitive radio ad hoc network (CRAHN). Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing CH‐based rendezvous schemes were not designed for CRAHNs operating under fast primary user (PU) dynamics and result in excessive rendezvous delay when applied in such dynamic environments. To cope with fast PU dynamics, we propose in this paper two efficient cyclic‐quorum–based CH rendezvous schemes, which we refer to as nested cyclic quorum channel hopping (NCQ‐CH) and minimal nested cyclic quorum channel hopping (MNCQ‐CH). The proposed schemes are tailored for the spectrum‐heterogeneous CRAHNs. In addition to proactively accounting for PU dynamics, our CH‐based rendezvous schemes are designed to react to fast PU dynamics on the fly. To achieve this online adaptation, we augment NCQ‐CH and MNCQ‐CH with efficient mechanisms for channel ranking and quorum selection. Our simulations demonstrate the superior performance of the proposed schemes under fast PU dynamics, in terms of the time‐to‐rendezvous and PU detection accuracy, as compared with existing rendezvous schemes in the literature.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient rendezvous schemes for fast‐varying cognitive radio ad hoc networks

Al-Mqdashi

Sali

Abdel-Rahman

et al. 2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Assume that SU A and SU B are equipped with an equal number of radios within the range of [1,3]. Fig.…”

Section: B Pairwise Multiradio Scenariomentioning

confidence: 99%

“…i) Asynchronous local clock. Synchronous algorithms (e.g., CACH [2] and QLCH [3]) assume that SUs are in-sync with each other. However, due to the difficulty in achieving clock synchronization between spatially dispersed SUs, it is thus necessary to support the asynchronous scenario for the rendezvous schemes.…”

Section: Introductionmentioning

confidence: 99%

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Yang

Liang

Zheng

et al. 2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-Channel rendezvous is a vital step to form a cognitive radio network (CRN). It is intractable to guarantee rendezvous for secondary users (SUs) within a short finite time in asynchronous, heterogeneous, and anonymous CRNs. However, most previous heterogeneous algorithms rely on explicit SUs' identifiers (IDs) to guide rendezvous, which is not fully distributed. In this paper, we exploit the mathematical construction of sunflower sets to develop a single-radio sunflower set (SSS)-based pairwise rendezvous algorithm. We propose an approximation algorithm to construct disjoint sunflower sets. Then, the SSS leverages the variant permutations of elements in sunflower sets to adjust the order of accessing channels instead of SUs' IDs, which is more favorable for anonymous SUs in distributed environments. We also propose a multiradio-sunflower-set-based pairwise rendezvous algorithm to bring additional rendezvous diversity and accelerate the rendezvous process. Moreover, for the case with more than two SUs, we propose a multiuser collaborative scheme in which SUs cooperatively exchange and update their channel-hopping sequences until rendezvous. We derive the theoretical upper and lower bounds of rendezvous latency of the proposed algorithms. Extensive simulation comparisons with the state-of-the-art blind-rendezvous algorithms are conducted, incorporating the metrics of maximum and expected time-to-rendezvous. The simulation results show that our algorithms can achieve rendezvous faster than previous works.

show abstract

“…Furthermore, the SH schemes in [19,28] are designed only for asymmetric-role environment, where SUs have preassigned role (i.e., SU is either a sender or receiver). However, this design limits the applications of the schemes; for example, SUs cannot work as a forwarder (i.e., receive packets from one SU and then forward them to another SU) due to the permanent role assignment [29]. Another drawback of these works is their limitations to provide a complete solution for combining the SH scheme with a suitable and efficient CH scheme which consider the unique traits of DIR-CRNs.…”

Section: Introductionmentioning

confidence: 99%

Combined Sector and Channel Hopping Schemes for Efficient Rendezvous in Directional Antenna Cognitive Radio Networks

Al-Mqdashi

Sali

Noordin

et al. 2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Rendezvous is a prerequisite and important process for secondary users (SUs) to establish data communications in cognitive radio networks (CRNs). Recently, there has been a proliferation of different channel hopping-(CH-) based schemes that can provide rendezvous without relying on any predetermined common control channel. However, the existing CH schemes were designed with omnidirectional antennas which can degrade their rendezvous performance when applied in CRNs that are highly crowded with primary users (PUs). In such networks, the large number of PUs may lead to the inexistence of any common available channel between neighboring SUs which result in a failure of their rendezvous process. In this paper, we consider the utilization of directional antennas in CRNs for tackling the issue. Firstly, we propose two coprimality-based sector hopping (SH) schemes that can provide efficient pairwise sector rendezvous in directional antenna CRNs (DIR-CRNs). Then, we propose an efficient CH scheme that can be combined within the SH schemes for providing a simultaneous sector and channel rendezvous. The guaranteed rendezvous of our schemes are proven by deriving the theoretical upper bounds of their rendezvous delay metrics. Furthermore, extensive simulation comparisons with other related rendezvous schemes are conducted to illustrate the significant outperformance of our schemes.

show abstract

A Fast Rendezvous-Guarantee Channel Hopping Protocol for Cognitive Radio Networks

Cited by 41 publications

References 30 publications

Efficient rendezvous schemes for fast‐varying cognitive radio ad hoc networks

Efficient rendezvous schemes for fast‐varying cognitive radio ad hoc networks

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Combined Sector and Channel Hopping Schemes for Efficient Rendezvous in Directional Antenna Cognitive Radio Networks

Contact Info

Product

Resources

About