How Local Information Improves Rendezvous in Cognitive Radio Networks

Fu, Yongqin; Wang, Yuexuan; Gu, Zhaoquan; Zheng, Xiaolin; Wei, Tianhao; Cao, Zhen; Cui, Heming; Lau, Francis C. M.

doi:10.1109/sahcn.2018.8397135

Cited by 8 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the available channels of a user is a subset of the N channels, the period of our ORTHO-CH sequence is (2p + 1)p, where p is the smallest prime not less than N . Thus, ORTHO-CH has the MTTR bound (2p + 1)p. Such a result is comparable to the best algorithms in the literature, e.g., FRCH [11] with the MTTR bound (2N + 1)N for N = ((5 + 2α) * r − 1)/2 for all integer α ≥ 0 and odd integer r ≥ 3, and SRR [12] with the MTTR bound 2p 2 + 2p.…”

Section: Introductionsupporting

confidence: 67%

“…For ORTHO-CH, such replacements can be chosen randomly. In comparison with the Sequence-Rotating-Rendezvous (SRR) algorithm in [12], our ORTHO-CH sequence reduces the MTTR from 2p 2 + 2p to (2p + 1)p. Both constructions are similar in the sense that they both are based on the two mathematical properties of orthogonal MACH matrices (and thus the proofs are also similar). The key difference is that the ORTHO-CH sequence is periodic while the SRR sequence is not.…”

Section: B From Orthogonal Mach Matrices To Asynchronous Ch Sequencesmentioning

confidence: 99%

See 1 more Smart Citation

On the Theoretical Gap of Channel Hopping Sequences with Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem

Chang,

Sheu,

Lin

2019

Preprint

View full text Add to dashboard Cite

In the literature, there are several well-known periodic channel hopping (CH) sequences that can achieve maximum rendezvous diversity in a cognitive radio network (CRN). For a CRN with N channels, it is known that the period of such a CH sequence is at least N 2 . The asymptotic approximation ratio, defined as the ratio of the period of a CH sequence to the lower bound N 2 when N → ∞, is still 2.5 for the best known CH sequence in the literature. An open question in the multichannel rendezvous problem is whether it is possible to construct a periodic CH sequence that has the asymptotic approximation ratio 1. In this paper, we tighten the theoretical gap by proposing CH sequences, called IDEAL-CH, that have the asymptotic approximation ratio 2.For a weaker requirement that only needs the two users to rendezvous on one commonly available channel in a period, we propose channel hopping sequences, called ORTHO-CH, with period (2p + 1)p, where p is the smallest prime not less than N .

show abstract

Section: Introductionsupporting

confidence: 67%

Section: B From Orthogonal Mach Matrices To Asynchronous Ch Sequencesmentioning

confidence: 99%