| 基于节点平均连接度的Ad Hoc网络分簇算法 |
| |
| 引用本文： | 杨卫东.基于节点平均连接度的Ad Hoc网络分簇算法[J].计算机工程与应用,2009,45(25):111-114. |
| |
| 作者姓名： | 杨卫东 |
| |
| 作者单位： | 南方医科大学,网络中心,广州,510515 |
| |
| 摘 要： | Ad Hoc网络是一种多跳的自组织网络,网络是由移动的节点组成。Ad Hoc网络的许多应用都依赖层次结构的支持,簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次结构的形成和维护依赖于某种分簇算法。提出了移动节点的平均连接度计算方法,并在此基础上提出了一种新的分簇算法(MCDA),通过对算法进行分析和仿真测试,证明了该算法的有效性。
|
| 关 键 词： | Ad Hoc网络 分簇算法 簇和簇头 平均连接度 |
| 收稿时间： | 2008-5-16 |
| 修稿时间： | 2008-8-26
|
Clustering algorithm for Ad Hoc network based on mean connectivity degree |
| |
| YANG Wei-dong.Clustering algorithm for Ad Hoc network based on mean connectivity degree[J].Computer Engineering and Applications,2009,45(25):111-114. |
| |
| Authors: | YANG Wei-dong |
| |
| Affiliation: | YANG Wei-dong Network Center,Southern Medical University,Guangzhou 510515,China |
| |
| 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 ... |
| |
| Keywords: | Ad Hoc network clustering algorithm cluster and cluster header mean connectivity degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
