MANET中基于连通支配集的组合权值簇生成算法  

Maximal weighted clustering algorithm based on connected dominating set for MANET

作　　者：李瑾[1] 潘宏[1] 刘中兵[1] 

机构地区：[1]泸州医学院现代教育技术部,四川泸州646000

出　　处：《计算机应用》2012年第7期1840-1843,1855,共5页journal of Computer Applications

摘　　要：对移动Ad Hoc网络(MANET)中的分簇机制进行了研究,提出一种基于连通支配集的组合权值簇生成算法(WCACDS),包括分簇算法和簇结构维护策略。通过节点的移动性、最小平均发射功率、能量消耗速度三方面的组合权值来量化节点的综合性能,利用改进后的求解连通支配集算法对节点分簇,以使性能较强的节点担任簇头,并且减少分簇数量。仿真实验结果表明,所提算法有助于提高网络负载均衡能力,增强网络的健壮性及稳定性。The authors studied the clustering mechanism in Mobile Ad Hoc Network（MANET） and proposed a maximal weighted clustering algorithm based on connected dominating set,including clustering algorithm and clustering maintenance strategy.The comprehensive performance of nodes was quantized by the weighted amount of node mobility,minimum average emissive power,and the energy consumption rate.The improved algorithm for solving connected dominating set was used for clustering the nodes,which made the higher performance nodes be the cluster heads and reduced the number of clusters.The simulation results show that the proposed algorithm is beneficial to improving the load balancing ability and enhancing the robustness and stability of the network.

关 键 词：移动ADHOC网络 分簇 连通支配集 组合权值 

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