Research on rendezvous algorithm based on asymmetric model in cognitive radio networks

Abstract

Cognitive radio is an important communication technology, which can relieve the situation of shortage and waste for spectrum source, and the rendezvous of cognitive users is the prerequisite of communication. This paper focuses on the algorithms for blind rendezvous, i.e., rendezvous without using any centralized controller and common control channel (CCC). Channel hopping sequence is an effective method to solve the problem of blind intersection. In this paper, we describe three kinds of rendezvous algorithm in detail, which based on the symmetric network, and apply these algorithms to asymmetric model with synchronous and asynchronous ways. We derive the maximum time-to-rendezvous (MTTR) and the expected time-to-rendezvous (ETTR) of algorithms for two users. Extensive simulations are conducted to evaluate the performance of these algorithms.