Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks
Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks
复制标题
DOI：
10.1109/tpds.2012.22
复制
发表时间：
2012-10-01
影响因子：
5.3
通讯作者：
Leung, Yiu-Wing
中科院分区：
文献类型：
--
作者：
Liu, Hai;Lin, Zhiyong;Leung, Yiu-Wing
认知无线电网络（crn）已成为利用现有无线频谱的先进和有前途的范例。crn中的用户通过交会过程寻找邻居，从而建立通信链路来交换频谱管理和信道争用等所需的信息是至关重要的。本文重点研究了盲交会算法的设计，即不使用任何集中控制器和公共控制通道（CCC）的盲交会。提出了一种用于盲交会的跳-停留信道跳（CH）算法。基本思想是生成一轮CH序列，每一轮由跳跃模式和停留模式组成。用户在跳转模式中“跳转”到可用频道，而在停留模式中“停留”到特定频道。我们证明了两个用户可以在跳-停留、停留-跳跃、跳跃-跳跃和停留-停留四种可能的模式组合之一中实现会合。与现有的CH算法相比，我们的算法在各种场景下的综合性能最好，适用于多用户和多跳场景的交会。我们推导了2用户和多用户场景下算法的最大交会时间（TTR）和预期TTR的上界（如表1所示）。进行了大量的仿真来评估我们的算法的性能。
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.