基于节点平均连接度的Ad Hoc网络分簇算法  

Clustering algorithm for Ad Hoc network based on mean connectivity degree

作　　者：杨卫东[1] 

机构地区：[1]南方医科大学网络中心,广州510515

出　　处：《计算机工程与应用》2009年第25期111-114,共4页Computer Engineering and Applications

摘　　要：Ad Hoc网络是一种多跳的自组织网络,网络是由移动的节点组成。Ad Hoc网络的许多应用都依赖层次结构的支持,簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次结构的形成和维护依赖于某种分簇算法。提出了移动节点的平均连接度计算方法,并在此基础上提出了一种新的分簇算法(MCDA),通过对算法进行分析和仿真测试,证明了该算法的有效性。Ad Hoc network is a kind of multi-hop self-organizing network.The network is dynamic in nature due to the mobility of nodes.Many mobile Ad Hoc applications depend on the hierarchical structure,and clustering is the most popular method with a hierarchical structure in the mobile Ad Hoc networks.A calculation algorithm for node＇s mean Connectivity degree is proposed. Then a novel clustering algorithm（MCDA） is proposed.Analysis and simulation of the algorithm have been implemented and validity of the algorithm has been proved.

关 键 词：AD HOC网络 分簇算法 簇和簇头 平均连接度 

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