Short Channel Hopping Sequence Approach to Rendezvous for Cognitive Networks

Reguera, Vitalio Alfonso; Guerra, Erik Ortiz; Souza, Richard Demo; Fernández, Evelio; Brante, Glauber

doi:10.1109/lcomm.2013.112713.132338

Cited by 32 publications

(28 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, FRCH can achieve deterministic rendezvous only when N = ((5 + 2α)r − 1)/2 (α is a nonnegative integer, and r is an odd integer larger than 3). The SSB algorithm [20], whose period is only 2N − 1 time slots, hops in a bottom-up and top-down manner. In terms of MTTR/ETTR, SSB outperforms FRCH and EJS.…”

Section: A Pairwise Single-radio Rendezvous Algorithmsmentioning

confidence: 99%

“…We compare the proposed SSS algorithm with two representative GC algorithms termed SSB [20] and HS [23] as well as two representative LC algorithms termed A-HCH [26] and CBH [27]. Note that SSB and HS are originally designed for the asymmetric model, and we extend them to the heterogeneous model.…”

Section: A Pairwise Single-radio Scenariomentioning

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%

“…10(a), but the differences are much smaller. When G increases to [13,20], MSS can achieve shorter ETTRs than Mc-Broadcast.…”

Section: B Pairwise Multiradio Scenariomentioning

confidence: 99%

See 3 more Smart Citations

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%

Section: A Pairwise Single-radio Scenariomentioning

confidence: 99%

Section: B Pairwise Multiradio Scenariomentioning

confidence: 99%

“…10(a), but the differences are much smaller. When G increases to [13,20], MSS can achieve shorter ETTRs than Mc-Broadcast.…”

Section: B Pairwise Multiradio Scenariomentioning

confidence: 99%

See 2 more Smart Citations

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

“…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%

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

Guerra

Reguera

Souza

et al. 2015

J Wireless Com Network

Self Cite

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

ADFC-CH: adjusted disjoint finite cover rendezvous algorithms for cognitive radio networks

2017

View full text Add to dashboard Cite

Short Channel Hopping Sequence Approach to Rendezvous for Cognitive Networks

Cited by 32 publications

References 9 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

ADFC-CH: adjusted disjoint finite cover rendezvous algorithms for cognitive radio networks

Contact Info

Product

Resources

About