Tight Lower Bounds for Channel Hopping Schemes in Cognitive Radio Networks

Chang, Cheng-Shang; Liao, Wanjiun; Wu, Tsung-Tsong

doi:10.1109/tnet.2015.2453403

Cited by 31 publications

(27 citation statements)

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

“…Asymmetric approaches require each SU to have a preassigned role as either a sender or a receiver, and allow the sender and the receiver to use different approaches to generate their respective CH sequences, while symmetric approaches do not. As summarized in [9], [12], previously known asymmetric ones such as A-MOCH [4], ACH [5], ARCH [6], D-QCH [10], and WFM [11] all produce smaller MCTTR than previously known symmetric ones, such as CRSEQ [1], JS [2], EJS [3], Sym-ACH [5], DRDS [7], HH [8], T-CH [9] and S-QCH [10]. However, to the authors' best knowledge, the following two fundamental problems have not been settled until now.…”

Section: Introductionmentioning

confidence: 99%

“…(i) What is the minimum MCTTR and MTTR of asynchronous CH sequences with the maximal rendezvous diversity? We note there are some recent papers [4], [11], [13] that made attempts to investigate this issue, but all are under additional constraints of sequence design. Bian et al in [4] provided a lower bound on MCTTR, however, the proof therein requires the assumption that the sequence period is equal to the MCTTR.…”

Section: Introductionmentioning

confidence: 99%

“…Bian et al in [4] provided a lower bound on MCTTR, however, the proof therein requires the assumption that the sequence period is equal to the MCTTR. Chang et al in [11] and [13] derived lower bounds on MCTTR and MTTR, respectively, but only considered the CH sequences that simultaneously satisfy the independence assumption (a pair of CH sequences are independent) and the uniform channel loading assumption (an SU hops to a particular channel at a particular interval with an equal probability).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Channel Hopping Sequences With Full Rendezvous Diversity for Cognitive Radio Networks

Zhang

Wong

2018

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

In cognitive radio networks (CRNs), establishing a communication link between a pair of secondary users (SUs) requires them to rendezvous on a common channel which is not occupied by primary users (PUs). Under time-varying PU traffic, asynchronous sequence-based channel hopping (CH) with the maximal rendezvous diversity is a representative technique to guarantee an upper bounded time-torendezvous (TTR) for delay-sensitive services in CRNs, without requiring global clock synchronization.Maximum TTR (MTTR) and maximum conditional TTR (MCTTR) are two commonly considered metrics for evaluating such CH sequences, and minimizing these two metrics is the primary goal in the sequence design of various paper reported in the literature. In this paper, to investigate the fundamental limits of these two metrics, we first derive lower bounds on the MCTTR and MTTR, and then propose an asymmetric design which has the minimum MCTTR and an improvement on MTTR than other previously known algorithms. Moreover, when the number of licensed channels is odd, our proposed design achieves the minimum MTTR. We also present the TTR performance of the proposed design via simulation. DRAFT This paper continues the work to investigate asynchronous CH sequences with the maximal rendezvous diversity under this objective. The follow-on tasks after initial rendezvous, such as channel contention procedure and data packet transmission, are outside the scope of this paper.Obviously, MTTR and MCTTR provide upper bounds on the TTR for two extreme channel conditions, and hence have been commonly considered for those applications that have stringent worst-case TTR requirement. DRAFT

show abstract