一种基于权重的动态分簇算法  

A weighted dynamic clustering algorithm

作　　者：张卫刚[1] 何庆[1] 陈浩亮 许骏[1] 

机构地区：[1]华南师范大学计算机学院,广东广州510631 [2]广州无线电研究所,广东广州510500

出　　处：《暨南大学学报（自然科学与医学版）》2009年第1期35-39,共5页Journal of Jinan University(Natural Science & Medicine Edition)

基　　金：广东省科技攻关计划项目(2006B15001004);广州市科研条件建设项目(穗科条2006-21)

摘　　要：基于分簇算法,提出了一种基于权重的动态分簇算法(WDCA).该算法综合考虑了节点与其邻居节点的相对速度,节点到其邻居节点的平均距离,节点的能量以及节点的邻居数等因素来选择簇头;同时取消了一般加权分簇算法中簇成员到簇头只有一跳的限制,而是根据簇内成员数动态调整.模拟结果表明,与经典的加权分簇算法(WCA)相比,该算法的簇头稳定性、网络的负载均衡都有很大提高.A weighted dynamic clustering algorithm（WDCA） is proposed which takes into consideration the relative velocity, average distance, battery power and neighbors of mobile nodes to selecting cluster head. The restriction in many weighted clustering algorithms, that the cluster members to their cluster head not exceed one hop is dropped, but dynamic adjustment it depends on the number of cluster member. The simulation results show that the stability of cluster heads, network load balancing have greatly improved compared to the typical algorithm weighted clustering algorithm （WCA）.

关 键 词：ADHOC网络 分簇算法 动态 权重 

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