| 移动自组织网中一种平均节点度分簇算法 |
| |
| 引用本文： | 苏晓,于洪. 移动自组织网中一种平均节点度分簇算法[J]. 重庆邮电学院学报(自然科学版), 2010, 0(2) |
| |
| 作者姓名： | 苏晓 于洪 |
| |
| 作者单位： | 重庆邮电大学计算机科学与技术研究所; |
| |
| 基金项目： | 重庆市教委项目(KJ080510)~~ |
| |
| 摘 要： | 针对移动adhoc网络现有分簇算法容易造成通信瓶颈的现象,在最高节点度分簇算法的基础上提出了基于平均节点度的分簇方法,通过选举具有合适节点度大小的节点作为簇头来平衡网络负载,应用Glomosim做的仿真结果显示该算法能较好维持网络的稳定性。
|
| 关 键 词： | MANET 分簇算法 虚拟骨干网 |
An average degree clustering algorithm in mobile ad hoc network |
| |
| SU Xiao,YU Hong. An average degree clustering algorithm in mobile ad hoc network[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition), 2010, 0(2) |
| |
| Authors: | SU Xiao YU Hong |
| |
| Affiliation: | Institute of Computer Science and Technology;Chongqing University of Posts and Telecommunications;Chongqing 400065;P.R.China |
| |
| Abstract: | In this paper,a clustering algorithm for mobile ad hoc network(MANET)named average degree clustering algorithm(ADCA)was presented.The proposed algorithm overcomes the shortcoming of those typical clustering algorithms which can easily bring in communication bottleneck.In order to balance the burden of nodes,those nodes which have proper degree were elected as cluster heads.The proposed ADCA was simulated by Glomosim,and the experimental result shows that the novel algorithm is good at maintaining the stabil... |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
|
