Rendezvous is a process that assists nodes in a cognitive radio networks (CRNs) to discover each other. In CRNs where a common control channel is unknown and a number of channels are given, it is important how two nodes find each other in a known search region. In this letter, we have analyzed a channel hopping sequence considering {p} -ray m-sequence by which each node visits an available number of channels. We analyze the maximum and expected time-to-rendezvous (TTR) mathematically. The proposed sequence performs significantly better compared to the existing ones in term of maximum and expected TTR.
Manuscript received February 21, 2019; accepted May 29, 2019. Date of publication June 7, 2019; date of current version December 6, 2019. This work was supported by the National Research Foundation of Korea (NRF) funded by the Ministry of Education under Grant 2017R1D1A1B03031408 and Grant 2019R1A2C1008530. Part of this work was included in the Ubiquitous and Future Networks (ICUFN) 2016. The associate editor coordinating the review of this paper and approving it for publication was H. Yomo. (Corresponding author: Jiwoong Jang.) R. Paul and Y.-J. Choi are with the Department of Software and Computer Engineering, Ajou University, Suwon 16499, South Korea (e-mail: rajib@ajou.ac.kr; choiyj@ajou.ac.kr).
