Rendezvous for Cognitive Radios
Rendezvous for Cognitive Radios
复制标题
DOI：
10.1109/tmc.2010.60
复制
发表时间：
2011-02-01
影响因子：
7.9
通讯作者：
DaSilva, Luiz A.
中科院分区：
文献类型：
--
作者：
Theis, Nick C.;Thomas, Ryan W.;DaSilva, Luiz A.
认知无线电已经被吹捧为在动态频谱接入环境中进行通信的解决方案。本文研究了认知无线电最初如何在不断变化的开放频谱中找到彼此，称为会合问题。具体而言，它解决了在不同水平的系统能力，频谱政策和环境条件下的会合问题。重点是在没有控制通道或集中式控制器的情况下的交会，我们称之为盲交会问题。在此条件下，提出了一种基于序列的模块化时钟盲会合算法，并表明这些算法的性能优于随机盲会合算法。具体而言，基于序列的算法提供了一个有界的时间到会合（TTR）和优先通道的能力，会合更有可能发生;模块化时钟算法减少了预期的TTR，需要很少的预协调尝试会合的无线电之间，是强大的无线电感测不同的可用信道集。
Cognitive radios have been touted as a solution to communicating in a Dynamic Spectrum Access environment. This paper examines how cognitive radios initially find one another among the expanse of ever-changing open spectrum, termed the rendezvous problem. Specifically, it addresses the problem of rendezvous under varying levels of system capabilities, spectrum policies, and environmental conditions. The focus is on rendezvous when there are are no control channels or centralized controllers, which we term the blind rendezvous problem. Under these conditions, a sequence-based and modular clock blind rendezvous algorithms are proposed, and it is shown that the performance of these algorithms compares favorably to that of a random blind rendezvous algorithm. Specifically, the sequence-based algorithm provides a bounded Time To Rendezvous (TTR) and the ability to prioritize channels where rendezvous is more likely to occur; the modular clock algorithm reduces the expected TTR, requires little precoordination among radios attempting to rendezvous, and is robust to radios sensing different sets of available channels.