English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The multi-channel blind rendezvous problem in distributed cognitive radionetworks (DCRNs) refers to how users in the network can hop to the same channelat the same time slot without any prior knowledge (i.e., each user is unawareof other users' information). The channel hopping (CH) technique is a typicalsolution to this blind rendezvous problem. In this paper, we propose a quinarycoding and matrix structure-based CH algorithm called QCMS-CH. The QCMS-CHalgorithm can guarantee the rendezvous of users using only one cognitive radioin the scenario of the asynchronous clock (i.e., arbitrary time drift betweenthe users), heterogeneous channels (i.e., the available channel sets of usersare distinct), and symmetric role (i.e., all users play a same role). TheQCMS-CH algorithm first represents a randomly selected channel (denoted by R)as a fixed-length quaternary number. Then it encodes the quaternary number intoa quinary bootstrapping sequence according to a carefully designedquaternary-quinary coding table with the prefix "R00". Finally, it builds a CHmatrix column by column according to the bootstrapping sequence and sixdifferent types of elaborately generated subsequences. The user can access theCH matrix row by row and accordingly perform its channel hopping to attempt torendezvous with other users. We prove the correctness of QCMS-CH and derive anupper bound on its Maximum Time-to-Rendezvous (MTTR). Simulation results showthat the QCMS-CH algorithm outperforms the state-of-the-art in terms of theMTTR and the Expected Time-to-Rendezvous (ETTR).

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