Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks

Abstract

Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any central controller and common control channel (CCC). We propose a jump-stay based channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users "jump" on available channels in the jump-pattern while "stay" on a specific channel in the stay-pattern. Compared with the existing CH algorithms, our algorithm achieves the following advances: i) guaranteed rendezvous without the need of timesynchronization; ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-torendezvous (TTR) and the upper-bound of expected TTR of our algorithm for both 2-user and multi-user scenarios (shown in Table I). Extensive simulations are further conducted to evaluate performance of our algorithm.

Virtual backbone construction for cognitive radio networks without common control channel

“…However, in this approach, many nodes need to compete for one rendezvous channel. A jump-and-stay model was proposed in [13]. It is a blind channel rendezvous model.…”

Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

“…In general, rendezvous approaches can be divided into three branches, first, non-quorum based solutions representing blind or pseudo-random RDV techniques ( [7][8][9] and more sophisticated [10,11]). To the second branch belong protocols proposed for a multichannel Medium Access Control (MAC) handling multi -rendezvous [12] (i.e., multiple transmissions pairs can accomplish handshaking simultaneously), missing receiver problem [13] or medium allocation in a hostile and jamming environment [14].…”

“…The CR nodes sweep through the ring visiting the vertices (channels) with different velocities and the rendezvous is guaranteed since the nodes with lower velocities will sooner or later be caught by the ones with higher velocities. In [11] the authors propose a jump-stay rendezvous algorithm for blind rendezvous, using jump-pattern and staypattern channel hoping sequences in each round. The CR nodes continuously "jump" on available channels during the jump-pattern and "stay" on a specific channel during the stay-pattern.…”

CACH: Cycle-Adjustable Channel hopping for control channel establishment in cognitive radio networks

“…Synchronous CH schemes can achieve better performance than asynchronous CH schemes as both SUs know when to start their CH sequences. If clock synchronization is difficult, there are also several novel symmetric and asynchronous CH schemes that have been proposed in the literature, e.g., SeqR [12], DSREQ [13], CRSEQ [14], ASYNCH-ETCH [15] and JS [16]. A comparison of all these CH schemes can be found in [19].…”

“…In general, one can increase system load to reduce TTR and such a tradeoff can then be used to optimize system performance. Unfortunately, most existing CH schemes [7][8] [10]- [16] in the literature were designed for a fixed environment and they cannot be easily adjusted to optimize system performance.…”