An efficient coprime integer sets based rendezvous algorithm for distributed cognitive radio networks

Abstract

AbstractMultichannel blind rendezvous problem is a fundamental problem in cognitive radio networks (CRNs). It refers to how to ensure that any two secondary users can meet on a common available channel at the same time. In this paper, an efficient channel hopping algorithm, called CISR (Coprime Integer Sets based Rendezvous), is designed for asymmetric role model (i.e. users can be divided into two types of roles, say, sender/leader and receiver/follower) in distributed CRNs. CISR can guarantee the rendezvous of the leader and follower and lowers the upper bound of both the maximum time to rendezvous and expected time to rendezvous by carefully constructing two coprime integer sets. The simulation results show that CISR has the near‐optimal performance.