电子学报2016，Vol.44Issue(10)：2323-2329,7.DOI:10.3969/j.issn.0372-2112.2016.10.006
认知Ad Hoc网络中基于信道相似度的分簇算法研究
Channel Si milarity Based Clustering Algorithm in Cognitive Ad Hoc Network
摘要
Abstract
As the traditional clustering algorithm cannot be applied to the cognitive ad hoc network for dynamic chan-nels,a distributed clustering algorithm based on the similarity of channels has been proposed.Firstly the channel similarity between nodes will be calculated and the probability of a node within the cluster will be estimated using an adapted EM algo-rithm.Then by using minimum cut algorithm in graph theory,the optimal clustering results will be obtained with maximum similarity within a cluster and minimum similarity between clusters.Finally,a coordination mechanism to synchronize the global clustering information has been proposed.Throughout,these processes are evenly distributed,without relying on a common control channel.The simulation results show that the proposed algorithm can change the cluster structure according to the dynamic nature of channels,increase the intra-cluster common channels,and effectively reduce inter-cluster common channels to lower the interference.关键词
认知Ad Hoc网络/分簇算法/信道相似度Key words
cognitive Ad Hoc network/clustering/channel similarity分类
信息技术与安全科学引用本文复制引用
徐宁,张沪寅,王晶,徐方,汪志勇..认知Ad Hoc网络中基于信道相似度的分簇算法研究[J].电子学报,2016,44(10):2323-2329,7.基金项目
国家自然科学基金（No．61272454）；高等学校博士学科点专项科研基金 （）
