Hybrid Rendezvous Algorithm against Jamming Attacks for Cognitive Radio Networks

摘要

Rendezvous is a fundamental step in communicating with cognitive radio networks. Existing rendezvous algorithms using the Channel Hopping (CH) method perform well to guarantee a rendezvous between Secondary Users (SUs) quickly. Jump-Stay based algorithms can guarantee rendezvous for asynchronous and asymmetric models, but these algorithms are particularly vulnerable to jamming attacks, which reduce rendezvous probability significantly from 100% to 10%. In this paper, we will introduce the Hybrid Rendezvous Algorithm (HRA), combining the positive benefits of existing algorithms in order to perform in both jamming and non-jamming situations.