首页 | 本学科首页   官方微博 | 高级检索  
     

MANET中基于连通支配集的组合权值簇生成算法
引用本文:李瑾,潘宏,刘中兵.MANET中基于连通支配集的组合权值簇生成算法[J].计算机应用,2012,32(7):1840-1843.
作者姓名:李瑾  潘宏  刘中兵
作者单位:泸州医学院 现代教育技术部,四川 泸州646000
摘    要:对移动Ad Hoc网络(MANET)中的分簇机制进行了研究,提出一种基于连通支配集的组合权值簇生成算法(WCACDS),包括分簇算法和簇结构维护策略。通过节点的移动性、最小平均发射功率、能量消耗速度三方面的组合权值来量化节点的综合性能,利用改进后的求解连通支配集算法对节点分簇,以使性能较强的节点担任簇头,并且减少分簇数量。仿真实验结果表明,所提算法有助于提高网络负载均衡能力,增强网络的健壮性及稳定性。

关 键 词:移动Ad  Hoc网络    分簇    连通支配集    组合权值
收稿时间:2011-12-05
修稿时间:2012-02-13

Maximal weighted clustering algorithm based on connected dominating set for MANET
LI Jin , PAN Hong , LIU Zhong-bing.Maximal weighted clustering algorithm based on connected dominating set for MANET[J].journal of Computer Applications,2012,32(7):1840-1843.
Authors:LI Jin  PAN Hong  LIU Zhong-bing
Affiliation:Modern Education Technology Department, Luzhou Medical College, Luzhou Sichuan 646000, China
Abstract: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.
Keywords:Mobile Ad Hoc Network(MANET)  clustering  connected dominating set  maximal weight
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号