| 一个用于Ad Hoc网络的分簇方法 |
| |
| 引用本文： | 程伟明,周新运.一个用于Ad Hoc网络的分簇方法[J].计算机学报,2005,28(5):864-869. |
| |
| 作者姓名： | 程伟明 周新运 |
| |
| 作者单位： | 中国科学院软件研究所,北京,100080 |
| |
| 基金项目： | 国家自然科学基金(60472076)资助.~~ |
| |
| 摘 要： | 该文提出了一种ad hoc网络的分簇方法，通过相关性来计算节点的相关度值，利用D—tree算法来对随机分布的移动节点分簇，实现ad hoc网络的层次结构的划分；并对算法进行了分析和模拟计算，得到了ad hoc网络主要技术参数之间的关系．
|
| 关 键 词： | 自组网 移动模式 簇和簇头 分簇算法 |
A Clustering Algorithm for Mobile Ad-Hoc Network |
| |
| CHENG Wei-Ming,ZHOU Xin-yun.A Clustering Algorithm for Mobile Ad-Hoc Network[J].Chinese Journal of Computers,2005,28(5):864-869. |
| |
| Authors: | CHENG Wei-Ming ZHOU Xin-yun |
| |
| Abstract: | 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. |
| |
| Keywords: | ad hoc network mobile pattern cluster and cluster header clustering algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
