A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks
A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks
复制标题
DOI：
10.1109/infocom.2016.7524556
复制
发表时间：
2016-04
期刊：
影响因子：
--
通讯作者：
Bofu Yang;M. Zheng;W. Liang
中科院分区：
文献类型：
--
作者：
Bofu Yang;M. Zheng;W. Liang
在认知无线电网络中，信道会合是次用户建立通信的先决条件。对于时延敏感的应用，期望在有限的时间内实现交会，并在所有可用信道上实现交会，以增加对不稳定信道的鲁棒性。现有的一些工作受到会合通道数量少的影响，并且只能在诸如同步时钟、同构可用通道、预定角色和显式SU的标识符（ID）等不期望的要求下保证会合。在本文中，为了解决这些局限性，我们采用不相交集覆盖（DSC）的概念，并提出了一个基于DSC的重命名（DSCR）算法。我们首先提出了一个近似算法来构造一个DSC。然后利用巧妙构造的DSC中的元素的变体排列来调节接入信道的顺序，使得SU能够在短时间内在所有可用信道上会合。我们推导出理论上的最大和预期的会合延迟，并证明了完全会合度的DSCR算法。大量的仿真结果表明，DSCR算法可以显着减少交会延迟相比，现有的算法。
Channel rendezvous is a prerequisite for secondary users (SUs) to set up communications in cognitive radio networks (CRNs). It is expected that the rendezvous can be achieved within a short finite time for delay-sensitive applications and over all available channels to increase the robustness to unstable channels. Some existing works suffer from a small number of rendezvous channels and can only guarantee rendezvous under the undesired requirements such as synchronous clock, homogeneous available channels, predetermined roles and explicit SUs' identifiers (IDs). In this paper, to address these limitations, we employ the notion of Disjoint Set Cover (DSC) and propose a DSC-based Rendezvous (DSCR) algorithm. We first present an approximation algorithm to construct one DSC. The variant permutations of elements in the ingeniously constructed DSC are then utilized to regulate the order of accessing channels, enabling SUs to rendezvous on all available channels within a short duration. We derive the theoretical maximum and expected rendezvous latency and prove the full rendezvous degree of the DSCR algorithm. Extensive simulations show that the DSCR algorithm can significantly reduce the rendezvous latency compared to existing algorithms.