Spectrum Opportunity-Based Control Channel Assignment in Cognitive Radio Networks
Spectrum Opportunity-Based Control Channel Assignment in Cognitive Radio Networks
复制标题
DOI：
10.1109/sahcn.2009.5168974
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Loukas Lazos;Sisi Liu;M. Krunz
中科院分区：
文献类型：
--
作者：
Loukas Lazos;Sisi Liu;M. Krunz
我们通过利用时间和空间变化的频谱机会来解决认知无线电网络（crn）中协调（控制）信道的动态分配问题。基于认知无线电（CR）用户根据信道可用性的固有分组，提出了一种基于集群的CRN控制信道分配架构。如果cr大致感知到相似的空闲通道并且在通信范围内（直接或通过簇头），则将它们分组在同一个集群中。我们将聚类设计表述为一个最大边椭圆问题。针对这一问题，提出了一种分布式聚类协议算法——频谱机会聚类算法（SOC）。SOC在两个相互竞争的因素之间提供了理想的平衡：每个集群内的公共空闲通道集和集群大小。如果当前控制通道上出现主无线电（PR）活动，那么每个集群中的大量公共空闲通道允许从该通道优雅地迁移。因此，SOC在本地协调方面提供了一个稳定的网络分区，不需要频繁的重新聚类。此外，当必须执行重新集群时（由于CR移动性或PR活动），CR只在广播三条消息后就新集群达成一致，从而产生较低的通信开销。
We address the problem of dynamic assignment of coordination (control) channels in cognitive radio networks (CRNs) by exploiting time- and space-varying spectrum opportunities. Motivated by the inherent grouping of Cognitive Radio (CR) users according to channel availability, we propose a cluster-based architecture for control-channel assignment in a CRN. CRs are grouped in the same cluster if they roughly sense similar idle channels and are within communication range, either directly or via a clusterhead. We formulate the clustering design as a maximum edge biclique problem. A distributed cluster agreement algorithm called Spectrum-Opportunity Clustering (SOC) is proposed to solve this problem. SOC provides a desirable balance between two competing factors: the set of common idle channels within each cluster and the cluster size. A large set of common idle channels within each cluster allows graceful migration from the current control channel should primary radio (PR) activity appear on that channel. Hence, SOC provides a stable network partition with respect to local coordination, with no need for frequent reclustering. Moreover, when reclustering has to be performed (due to CR mobility or PR activity), CRs agree on new clusters after the broadcast of only three messages, thus incurring low communication overhead.