Yongchul Kim, Moo-Hyun Lee, Sungjae Park, Sunghwan Cho, Journal of Internet Computing and Services, Vol. 27, No. 1, pp. 1-11, Feb. 2026
10.7472/jksii.2026.27.1.1, Full Text:  HTML
Keywords: Cognitive radio network, Rendezvous Algorithm, Asynchronous Channel Hopping

Abstract

In decentralized Cognitive Radio networks(CRNs), establishing communication between secondary users requires the ability to rendezvous on a shared channel, often referred to as the rendezvous channel. This process becomes challenging when primary users occupy channels unpredictably, rendering certain frequencies temporarily unavailable and increasing the risk of rendezvous failure. To address this, channel hopping (CH) protocols have been developed to facilitate rendezvous. However, many existing solutions either rely on idealized assumptions, such as clock synchronization, or lack robustness against primary user interference. This work proposes an asymmetric variant of the Asynchronous Channel Hopping (ACH) algorithm while also addressing the symmetric aspects, aiming to better align with theoretical frameworks while addressing practical limitations. By tailoring channel hopping sequences and introducing asymmetry, the goal is to enhance rendezvous efficiency, particularly in configurations with a larger number of available channels. To validate its performance, simulations are conducted to observe the time required for rendezvous, highlighting the ability of both asymmetric and symmetric ACH algorithms to approach theoretical benchmarks while dynamically adapting to real-world constraints.

Statistics
Cite this article