| Ad Hoc网络中基于节点的最小覆盖研究 |
| |
| 引用本文： | 李薇,张建军,胡伟文,宋业新.Ad Hoc网络中基于节点的最小覆盖研究[J].微计算机信息,2007,23(12):109-111. |
| |
| 作者姓名： | 李薇 张建军 胡伟文 宋业新 |
| |
| 作者单位： | 430033,湖北武汉,海军工程大学理学院 |
| |
| 摘 要： | 基于分簇算法的分簇结构对提高Ad Hoc网络的性能有着重要的意义。文中基于一跳覆盖区半径之和最小提出了一种分簇算法,给出的应用实例说明了该算法是可行的,而且基于该算法划分的网络抗毁性较强。
|
| 关 键 词： | AdHoc网络 分簇算法 连通 |
| 文章编号： | 1008-0570（2007）04-3-0109-03 |
| 修稿时间： | 2007-03-03 |
The Research of the Node-based Minimal Overlay of the Ad Hoc Network |
| |
| LI WEI,ZHANG JIANJUN,HU WEIWEN,SONG YEXIN.The Research of the Node-based Minimal Overlay of the Ad Hoc Network[J].Control & Automation,2007,23(12):109-111. |
| |
| Authors: | LI WEI ZHANG JIANJUN HU WEIWEN SONG YEXIN |
| |
| Affiliation: | College of Science, Naval University of Engineering, Wuhan, Hubei, 430033 |
| |
| Abstract: | The clustering structure based on clustering algorithms plays a very important role in improving the performance of the Ad Hoc network. Based on the minimization of the sum of the radii of the one-jump overlay region, a clustering algorithm is proposed in this paper. The given practical instance shows that the algorithm is practical and the networks partitioned by this algorithm have stronger anti-devastation nature. |
| |
| Keywords: | Ad Hoc network clustering algorithm connectivity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
