首页> 中文期刊> 《计算机应用》 >MANET中基于连通支配集的组合权值簇生成算法

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

         

摘要

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.%对移动Ad Hoc网络(MANET)中的分簇机制进行了研究,提出一种基于连通支配集的组合权值簇生成算法(WCACDS),包括分簇算法和簇结构维护策略.通过节点的移动性、最小平均发射功率、能量消耗速度三方面的组合权值来量化节点的综合性能,利用改进后的求解连通支配集算法对节点分簇,以使性能较强的节点担任簇头,并且减少分簇数量.仿真实验结果表明,所提算法有助于提高网络负载均衡能力,增强网络的健壮性及稳定性.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号