• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (11): 6-9.

• 论文 • 上一篇    下一篇

组移动模型下MANET网络单跳簇生成算法性能分析

况晓辉[1] 赵刚[1,2] 郭勇[1,3] 王东霞[1]   

  • 出版日期:2007-11-01 发布日期:2010-05-30

  • Online:2007-11-01 Published:2010-05-30

摘要:

在移动自组网络中,许多应用都依赖层次结构的支持。簇结构是移动自组网络中应用最为广泛的层次结构。针对现有簇生成算法在具有群组特性应用中性能分析不足的问题, 本文在分析随机移动模型和组移动模型特性以及主要簇生成算法优缺点的基础上,通过扩展ns2分析了五种典型簇生成算法在组移动模型下存在的不足,并提出了适应具有群
 组特性应用的簇生成算法研究思路。

关键词: 移动自组网络 移动模型 簇生成算法 性能分析

Abstract:

Many mobile ad hoc network applications depend upon the hierarchical structure. Clustering is the most popular method to impose a hierarchical structu  re in the ad hoc networks. This paper aims at the deficiency of the clustering algorithm performance analysis in group communication applications. Based  on analyzing the characteristics of the mobility model and typical clustering algorithms, five major one-hop clustering algorithms are compared and eva  luated using the group mobility model RPGM in the paper. Drawbacks of the current clustering algorithms under the group mobility model are pointed out a nd the implications on the clustering algorithms in group communication applications are discussed in the end.

Key words: mobile ad hoc network;mobility model, clustering algorithm;performance analysis