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

In cognitive radio networks, rendezvous is a fundamental operation by whichtwo cognitive users establish a communication link on a commonly-availablechannel for communications. Some existing rendezvous algorithms can guaranteethat rendezvous can be completed within finite time and they generatechannel-hopping (CH) sequences based on the whole channel set. However, somechannels may not be available (e.g., they are being used by the licensed users)and these existing algorithms would randomly replace the unavailable channelsin the CH sequence. This random replacement is not effective, especially whenthe number of unavailable channels is large. In this paper, we design a newrendezvous algorithm that attempts rendezvous on the available channels onlyfor faster rendezvous. This new algorithm, called Interleaved Sequences basedon Available Channel set (ISAC), constructs an odd sub-sequence and an evensub-sequence and interleaves these two sub-sequences to compose a CH sequence.We prove that ISAC provides guaranteed rendezvous (i.e., rendezvous can beachieved within finite time). We derive the upper bound on the maximumtime-to-rendezvous (MTTR) to be O(m) (m is not greater than Q) under thesymmetric model and O(mn) (n is not greater than Q) under the asymmetric model,where m and n are the number of available channels of two users and Q is thetotal number of channels (i.e., all potentially available channels). We conductextensive computer simulation to demonstrate that ISAC gives significantlysmaller MTTR than the existing algorithms.

Efficient Channel-Hopping Rendezvous Algorithm Based on Available Channel Set