The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 23)
ISSN: 1045-9219
pp: 1867-1881
Hai Liu , Hong Kong Baptist University, Hong Kong
Zhiyong Lin , GuangDong Polytechnic Normal University, GuangZhou
Xiaowen Chu , Hong Kong Baptist University, Hong Kong
Yiu-Wing Leung , Hong Kong Baptist University, Hong Kong
Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention, etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any centralized controller and common control channel (CCC). We propose a jump-stay channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users “jump” on available channels in the jump-pattern while “stay” on a specific channel in the stay-pattern. We prove that two users can achieve rendezvous in one of four possible pattern combinations: jump-stay, stay-jump, jump-jump, and stay-stay. Compared with the existing CH algorithms, our algorithm has the overall best performance in various scenarios and is applicable to rendezvous of multiuser and multihop scenarios. We derive upper bounds on the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithm for both 2-user and multiuser scenarios (shown in Table 1). Extensive simulations are conducted to evaluate the performance of our algorithm.
Algorithm design and analysis, Cognitive radio, Indexes, Synchronization, Clocks, Numerical models, channel hopping, Cognitive radio, blind rendezvous

X. Chu, Z. Lin, H. Liu and Y. Leung, "Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1867-1881, 2012.
93 ms
(Ver 3.3 (11022016))