认知无线电中基于相似性的自适应分簇算法  

A Comparability Based Adaptive Clustering Algorithm in Cognitive Radio Network

作　　者：薛钰[1] 曾志民[1] 郭义武[1] 郭彩丽[1] 

机构地区：[1]北京邮电大学通信网络综合技术研究所,北京100876

出　　处：《北京邮电大学学报》2008年第3期89-93,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(60772110);教育部博士点基金项目(20040013010)

摘　　要：针对认知无线电网络(CRN)中可用信道实时变化的特点,运用图形理论提出一种基于相似性的自适应分簇(CBAC)算法.该算法是以用户可用信道的相似性为基础,结合用户的移动性,通过计算节点权值实现CRN的优化分簇.仿真分析证明,CBAC算法提高了系统的链路平均可用信道数,相比传统的分簇算法,能提高频谱的利用效率.According to the characteristic of real-time changes of available channels in cognitive radio network, a new comparability based adaptive clustering algorithm （CBAC） in application of graph theory is proposed. Based on the comparability of users＇ available channels and the consideration of mobility of cognitive radio users, the algorithm optimizes the clustering result in cognitive radio network via computing the node＇s weight. Experiments show that the CBAC algorithm increases the number of the link＇s average available channels and has higher spectrum utilization rate and lower communication overhead than that of traditional clustering algorithms.

关 键 词：认知无线电 自适应分簇 可用信道相似性 链路平均可用信道 

分 类 号：TN915.01[电子电信—通信与信息系统]