A Channel Rendezvous Scheme for Cognitive Radio Networks
A Channel Rendezvous Scheme for Cognitive Radio Networks
复制标题
DOI：
10.1109/lcomm.2010.091010.100904
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Jongmin Shin;Dongmin Yang;Cheeha Kim
中科院分区：
文献类型：
--
作者：
Jongmin Shin;Dongmin Yang;Cheeha Kim
认知无线电网络需要以动态和机会主义的方式利用可用频谱，而不会对位于同一位置的主节点造成干扰。在开始数据传输之前，从节点必须在一条主节点未占用的信道上建立链路。不幸的是，在认知无线网络中，每个节点的可用信道集可能不同，因为它是由节点与主节点的相对位置决定的。我们首次提出了一种分布式通道会合方案，该方案在有限的时间内发现任意两个节点之间的公共可用通道，而不需要同步。我们的方案决定了两个节点访问通道的顺序，以便在有限的时间内找到一个公共通道（如果有的话）。
Cognitive radio networks need to utilize available spectrum in a dynamic and opportunistic fashion without causing interference to co-located primary nodes. Before data transmission begins, secondary nodes must establish a link on a channel which is not occupied by primary nodes. Unfortunately, in cognitive radio networks, the set of available channels can be different for each node, since it is determined by the relative locations of nodes to primary nodes. We are the first to present a distributed channel rendezvous scheme which finds a commonly available channel between any two nodes in a bounded time without synchronization. Our scheme determines the order, in which two nodes visit channels to find a common channel, if any, within a bounded time.