基于Ad Hoc网络的新型分群算法研究  

Research of new clustering algorithm based on Ad Hoc networks

作　　者：乔平安[1] 周敏[1] 刘运爽 

机构地区：[1]西安邮电大学计算机学院,西安710121

出　　处：《计算机工程与应用》2017年第13期129-133,共5页Computer Engineering and Applications

摘　　要：现有的Ad Hoc网络分群算法大多对网络的稳定性考虑不足,在实际场景中难以应用。从已有分群技术出发,对三种分群算法进行比较分析,在模糊聚类的基础上,设计了Packet数据包和定时器,并利用隶属度的概念,提出了一种新型CABF(Clustering Algorithm Based FCM)分群算法。仿真结果表明,该算法与最小ID算法、WCA算法、LEACH算法相比,具有更好的稳定性。Due to lack of network stability considerations, most existing Ad Hoc clustering algorithms are difficult to apply in the actual scene. At first, analysis and comparison of three algorithms form existing clustering algorithms, then on the basis of fuzzy clustering, the paper designs Packet data packets and timers, and also uses the concept of membership degree, at final proposes a new clustering algorithm. Simulation results show that compared with LOW-ID algorithm,WCA algorithm and LEACH algorithm, this algorithm has better stability.

关 键 词：AD HOC网络 分群算法 模糊聚类 隶属度μ 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]