A Quinary Coding and Matrix Structure-based Channel Hopping Algorithm for Blind Rendezvous in Cognitive Radio Networks

08/23/2022
by   Qinglin Liu, et al.
0

The multi-channel blind rendezvous problem in distributed cognitive radio networks (DCRNs) refers to how users in the network can hop to the same channel at the same time slot without any prior knowledge (i.e., each user is unaware of other users' information). The channel hopping (CH) technique is a typical solution to this blind rendezvous problem. In this paper, we propose a quinary coding and matrix structure-based CH algorithm called QCMS-CH. The QCMS-CH algorithm can guarantee the rendezvous of users using only one cognitive radio in the scenario of the asynchronous clock (i.e., arbitrary time drift between the users), heterogeneous channels (i.e., the available channel sets of users are distinct), and symmetric role (i.e., all users play a same role). The QCMS-CH algorithm first represents a randomly selected channel (denoted by R) as a fixed-length quaternary number. Then it encodes the quaternary number into a quinary bootstrapping sequence according to a carefully designed quaternary-quinary coding table with the prefix "R00". Finally, it builds a CH matrix column by column according to the bootstrapping sequence and six different types of elaborately generated subsequences. The user can access the CH matrix row by row and accordingly perform its channel hopping to attempt to rendezvous with other users. We prove the correctness of QCMS-CH and derive an upper bound on its Maximum Time-to-Rendezvous (MTTR). Simulation results show that the QCMS-CH algorithm outperforms the state-of-the-art in terms of the MTTR and the Expected Time-to-Rendezvous (ETTR).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2019

ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States

In this paper, we consider the multichannel rendezvous problem in cognit...
research
02/19/2019

A Quasi-random Algorithm for Anonymous Rendezvous in Heterogeneous Cognitive Radio Networks

The multichannel rendezvous problem that asks two secondary users to ren...
research
07/02/2019

A Reinforcement Learning Approach for the Multichannel Rendezvous Problem

In this paper, we consider the multichannel rendezvous problem in cognit...
research
04/17/2021

PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity

We propose a periodic channel hopping (CH) sequence, called PPoL (Packin...
research
07/26/2018

The Strongly Asynchronous Massive Access Channel

This paper considers a Strongly Asynchronous and Slotted Massive Access ...
research
12/11/2019

Cross-layer Design and SDR Implementation of DSA, Backpressure Routing and Network Coding

A cross-layer cognitive radio system is designed to support unicast and ...
research
10/18/2018

Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

New communication standards need to deal with machine-to-machine communi...

Please sign up or login with your details

Forgot password? Click here to reset