首页 | 本学科首页   官方微博 | 高级检索  
     

基于频谱感知的认知Ad hoc网络分簇算法
引用本文:齐全,王可人,杜奕航.基于频谱感知的认知Ad hoc网络分簇算法[J].数据采集与处理,2018,33(1):41-50.
作者姓名:齐全  王可人  杜奕航
作者单位:国防科技大学电子对抗学院, 合肥, 230037
摘    要:为了提高认知Ad hoc网络频谱感知效率,解决认知Ad hoc网络分簇问题,本文提出一种基于频谱感知的认知Ad hoc网络分簇算法。通过引入检测因子,综合考虑多个主用户信号交叠与阴影衰落的情况,将认知Ad hoc网络中的次用户节点与需要检测的主用户信道建模为二部图模型,使得分簇问题简化为最大权边二部图(Constraint maximum-weight edge biclique, C-MWEB)分解问题,并设计一种贪婪算法对其求解。仿真结果表明,在多个主用户信号交叠与阴影衰落并存的情况下,相较于传统算法,本文算法分簇更为合理,具有更好的有效性与可靠性。

关 键 词:认知无线网络  频谱感知  分簇  二部图  检测因子

Clustering Scheme Based on Spectrum Sensing in Cognitive Radio Ad hoc Networks
Qi Quan,Wang Keren,Du Yihang.Clustering Scheme Based on Spectrum Sensing in Cognitive Radio Ad hoc Networks[J].Journal of Data Acquisition & Processing,2018,33(1):41-50.
Authors:Qi Quan  Wang Keren  Du Yihang
Affiliation:Electronic Countermeasure Institute, National University of Defense Technology, Hefei, 230037, China
Abstract:To improve the spectrum sensing efficiency of cognitive radio Ad hoc networks and to solve the problem of cognitive radio Ad hoc networks clustering, a clustering scheme based on spectrum sensing for cognitive radio Ad hoc networks clustering is proposed. By introducing the detection factor, considering multiple primary user signals overlapping and shadow fading effect, the clustering problem of secondary users and primary user channels is mapped to bipartitie model. Then the clustering problem can be simplified to constraint maximum-weight edge biclique(C-MWEB) decomposition problem and solved by greedy algorithm. Simulation result shows that the proposed clustering scheme is more effective and reliable than the traditional one in the case of multiple primary user signals overlapping and shadow fading effect.
Keywords:cognitive radio network  spectrum sensing  clustering  bipartite graph  detection factor
点击此处可从《数据采集与处理》浏览原始摘要信息
点击此处可从《数据采集与处理》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号