A novel fast and fair asynchronous channel hopping rendezvous scheme in cognitive radio networks for internet of things

Abstract

Recent years have witnessed significant growth in the area of Internet of things (IoT) and is further expected to increase manifolds in the foreseeable future. Such a massive usage of IoT comes with spectrum scarcity issues. In the last few years, Cognitive Radio Network (CRN) has been widely researched because of its potential to be an effective solution to the problem of spectrum scarcity. The unlicensed users in CRN need to rendezvous on a commonly available channel for the purpose of necessary information exchange. Channel hopping (CH) is one of the representative technique to achieve rendezvous in CRNs in which users hop among available channels according to a pre-defined sequence. Providing guaranteed rendezvous which is fair and having full rendezvous diversity in minimum possible time is a challenging issue in CRN. In this paper, we propose an asymmetric asynchronous CH algorithm that provides guaranteed, fair and full rendezvous diversity among the users. The idea is to construct sender and receiver matrices to generate CH sequences based on the number of available channels of sender and receiver. Analytical and simulation results verify that the proposed algorithm outperform some existing state of the art rendezvous algorithms in terms of maximum time to rendezvous (MTTR), provide full rendezvous diversity and rendezvous fairness among the users.