Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (25): 111-114.DOI: 10.3778/j.issn.1002-8331.2009.25.034

• 网络、通信、安全 • Previous Articles     Next Articles

Clustering algorithm for Ad Hoc network based on mean connectivity degree

YANG Wei-dong   

  1. Network Center,Southern Medical University,Guangzhou 510515,China
  • Received:2008-05-16 Revised:2008-08-26 Online:2009-09-01 Published:2009-09-01
  • Contact: YANG Wei-dong

基于节点平均连接度的Ad Hoc网络分簇算法

杨卫东   

  1. 南方医科大学 网络中心,广州 510515
  • 通讯作者: 杨卫东

Abstract: Ad Hoc network is a kind of multi-hop self-organizing network.The network is dynamic in nature due to the mobility of nodes.Many mobile Ad Hoc applications depend on the hierarchical structure,and clustering is the most popular method with a hierarchical structure in the mobile Ad Hoc networks.A calculation algorithm for node’s mean connectivity degree is proposed.Then a novel clustering algorithm(MCDA) is proposed.Analysis and simulation of the algorithm have been implemented and validity of the algorithm has been proved.

Key words: Ad Hoc network, clustering algorithm, cluster and cluster header, mean connectivity degree

摘要: Ad Hoc网络是一种多跳的自组织网络,网络是由移动的节点组成。Ad Hoc网络的许多应用都依赖层次结构的支持,簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次结构的形成和维护依赖于某种分簇算法。提出了移动节点的平均连接度计算方法,并在此基础上提出了一种新的分簇算法(MCDA),通过对算法进行分析和仿真测试,证明了该算法的有效性。

关键词: Ad Hoc网络, 分簇算法, 簇和簇头, 平均连接度

CLC Number: