Enhanced Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks

Zhang, Lin; Liu, Hai; Chu, Xiaowen; Leung, Yiu-Wing

doi:10.1109/lcomm.2013.071013.131029

Cited by 114 publications

(77 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In each period, JS continuously switches channels during the jump pattern (2P time slots) and then stays on a specific channel during the stay pattern (P time slots). The EJS algorithm [16] is modified from JS, in which the jump pattern is prolonged to 3P time slots. EJS achieves shorter MTTR/ETTR than JS when SUs own asymmetric channels.…”

Section: A Pairwise Single-radio Rendezvous Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: A Pairwise Single-radio Rendezvous Algorithmsmentioning

confidence: 99%

“…It can be observed that the MTTR of MSS is shorter than RPS under all values of G. However, MSS does not outperform Mc-Broadcast when G 15. Only when G increases to [16,20] can MSS outperform Mc-Broadcast. Even so, Mc-Broadcast is not quite a flexible algorithm.…”

Section: B Pairwise Multiradio Scenariomentioning

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

show abstract

“…In this paper, we consider that during the rendezvous attempt the PUs operate in a fixed set of channels and that the SUs have prior knowledge of the state of each of the network channels a . With this knowledge, some authors [16,[25][26][27][28][29] provide each SU with the ability to attempt to rendezvous only in a channel previously identified as available (free of PU interference).…”

Section: Related Workmentioning

confidence: 99%

“…Most works regarding CH rendezvous [14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29] consider that the time is divided into slots and the time to rendezvous (TTR) is defined as the number of time slots needed to successfully rendezvous after all SUs have begun the CH sequences. Moreover, the expected TTR (ETTR) and the maximum TTR (MTTR) are two important metrics commonly used to evaluate these strategies and are often computed when all channels are available.…”

Section: Introductionmentioning

confidence: 99%

“…The authors in [15,16] adopt the term maximum conditional TTR (MCTTR) to refer to the MTTR when not all channels are available to all SUs. Some authors [15,17,27,30] also consider in the design of CH sequences the number of channels in which the rendezvous may occur (rendezvous diversity). However, most of them only make a qualitative analysis of this parameter.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Systematic construction of common channel hopping rendezvous strategies in cognitive radio networks

Guerra

Reguera

Souza

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

Cognitive radio networks (CRNs) have emerged as a promising paradigm that can solve the shortage of spectrum resources, providing the ability to adapt and opportunistically exploit the spectrum holes. The rendezvous process allows cognitive users to find a common channel and establish a communication link. In this paper, we focus on the design of fast blind rendezvous algorithms to guarantee that every node should be able to rendezvous in all common available channels. We follow a systematic approach by first proposing a role-based algorithm that ensures maximum rendezvous diversity and then extending it to a common strategy through the use of multiples radios. Both proposals guarantee rendezvous under symmetric and asymmetric models. Simulation results show that our proposals outperform other recently developed rendezvous protocols with similar approaches in terms of expected time to rendezvous and maximum time to rendezvous.

show abstract

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

Enhanced Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks

Cited by 114 publications

References 6 publications

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

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

Systematic construction of common channel hopping rendezvous strategies in cognitive radio networks

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

Contact Info

Product

Resources

About