A quorum-based framework for establishing control channels in dynamic spectrum access networks
A quorum-based framework for establishing control channels in dynamic spectrum access networks
复制标题
DOI：
10.1145/1614320.1614324
复制
发表时间：
2009-09
期刊：
影响因子：
--
通讯作者：
Kaigui Bian;J. Park;Ruiliang Chen
中科院分区：
文献类型：
--
作者：
Kaigui Bian;J. Park;Ruiliang Chen
在多信道和动态频谱接入（DSA）网络中，建立用于媒体接入控制的控制信道是一个具有挑战性的问题。在多信道MAC协议的设计中，使用信道（或频率）跳变技术（也称为并行会合）以避免单个控制信道的瓶颈。在DSA网络中，可用频谱的动态和机会性使用要求无线电能够“会合”，即，找到对方建立联系专用全局控制信道的使用简化了会合过程，但是由于包括控制信道的所有信道的动态变化的可用性，在许多机会频谱共享场景中可能是不可行的。为了解决这个问题，研究人员提出了使用信道跳变协议来实现DSA网络中的会合。本文提出了一个系统的方法，基于仲裁系统，设计和分析的信道跳频协议的目的，控制信道的建立。所提出的方法，称为基于配额的信道跳频（QCH）系统，可以用于实现会合协议在DSA网络中，是强大的对链路中断所造成的现任用户信号的外观。我们描述了两个最优的QCH系统的假设下，全球时钟同步：第一个系统是最优的意义上，它最大限度地减少任何两个信道跳频序列之间的时间交会;第二个系统是最优的意义上，它保证了均匀分布的交会点的时间和信道，从而解决\n {交会收敛}问题。我们还提出了一个异步QCH系统，不需要全局时钟同步。我们的分析和仿真结果表明，使用我们的框架设计的信道跳频方案优于现有的计划在各种网络条件下。
Establishing a control channel for medium access control is a challenging problem in multi-channel and dynamic spectrum access (DSA) networks. In the design of multi-channel MAC protocols, the use of channel (or frequency) hopping techniques (a.k.a. parallel rendezvous) have been proposed to avoid the bottleneck of a single control channel. In DSA networks, the dynamic and opportunistic use of the available spectrum requires that the radios are able to "rendezvous" -- i.e., find each other to establish a link. The use of a dedicated global control channel simplifies the rendezvous process but may not be feasible in many opportunistic spectrum sharing scenarios due to the dynamically changing availability of all the channels, including the control channel. To address this problem, researchers have proposed the use of channel hopping protocols for enabling rendezvous in DSA networks. This paper presents a systematic approach, based on quorum systems, for designing and analyzing channel hopping protocols for the purpose of control channel establishment. The proposed approach, called Quorum-based Channel Hopping (QCH) system, can be used for implementing rendezvous protocols in DSA networks that are robust against link breakage caused by the appearance of incumbent user signals. We describe two optimal QCH systems under the assumption of global clock synchronization: the first system is optimal in the sense that it minimizes the time-to-rendezvous between any two channel hopping sequences; the second system is optimal in the sense that it guarantees the even distribution of the rendezvous points in terms of both time and channel, thus solving the \emph{rendezvous convergence} problem. We also propose an asynchronous QCH system that does not require global clock synchronization. Our analytical and simulation results show that the channel hopping schemes designed using our framework outperform existing schemes under various network conditions.