一个用于Ad Hoc网络的分簇方法  

A Clustering Algorithm for Mobile Ad-Hoc Network

作　　者：程伟明[1] 周新运[1] 

机构地区：[1]中国科学院软件研究所,北京100080

出　　处：《计算机学报》2005年第5期864-869,共6页Chinese Journal of Computers

基　　金：国家自然科学基金(60472076)资助.~~

摘　　要：该文提出了一种adhoc网络的分簇方法,通过相关性来计算节点的相关度值,利用D tree算法来对随机分布的移动节点分簇,实现adhoc网络的层次结构的划分;并对算法进行了分析和模拟计算,得到了adhoc网络主要技术参数之间的关系.In this paper, a clustering algorithm for ad hoc network named D-tree is proposed. After calculating the value of relation between ad hoc network nodes by using relativity concept, the D-tree algorithm can be used for clustering the random located mobile nodes. The analysis and simulation of D-tree has been implemented and the relation between network variables has been got.

关 键 词：自组网 移动模式 簇和簇头 分簇算法 

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