Journal of Computer Applications ›› 2012, Vol. 32 ›› Issue (07): 1840-1843.DOI: 10.3724/SP.J.1087.2012.01840

• Network and communications • Previous Articles     Next Articles

Maximal weighted clustering algorithm based on connected dominating set for MANET

LI Jin,PAN Hong,LIU Zhong-bing   

  1. Modern Education Technology Department, Luzhou Medical College, Luzhou Sichuan 646000, China
  • Received:2011-12-05 Revised:2012-02-13 Online:2012-07-05 Published:2012-07-01
  • Contact: LI Jin



  1. 泸州医学院 现代教育技术部,四川 泸州646000
  • 通讯作者: 李瑾
  • 作者简介:李瑾(1984-),女,四川绵阳人,助教,硕士,主要研究方向:计算机网络、语义网、面向服务的计算、智能计算机辅助教育;潘宏(1979-),男,四川泸州人,讲师,主要研究方向:计算机网络;刘中兵(1974-),男,四川泸州人,讲师,主要研究方向:计算机网络。

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.

Key words: Mobile Ad Hoc Network (MANET), clustering, connected dominating set, maximal weight

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

关键词: 移动Ad Hoc网络, 分簇, 连通支配集, 组合权值

CLC Number: