东北大学学报(自然科学版) ›› 2004, Vol. 25 ›› Issue (4): 322-324.DOI: -

• 论著 • 上一篇    下一篇

一种基于链路稳定性的自组网成簇算法

赵春晓;王光兴;刘彪   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;渤海大学信息科学与工程学院 辽宁沈阳 110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2004-04-15 发布日期:2013-06-24
  • 通讯作者: Zhao, C.-X.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(863 708)·

Clustering algorithm based on link stability in MANET

Zhao, Chun-Xiao (1); Wang, Guang-Xing (1); Liu, Biao (2)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China; (2) Sch. of Info. Sci. and Eng., Bohai Univ., Jinzhou 121000, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-04-15 Published:2013-06-24
  • Contact: Zhao, C.-X.
  • About author:-
  • Supported by:
    -

摘要: 简要介绍了多跳无线自组织网络的特征并和相关的工作进行了比较,鉴于自组织网络的高度动态拓扑且缺少固定架构,提出了一个新的时间度定义·通过分析两个相邻节点的链路关系,建立了基于两个相邻节点的链路寿命的网络模型·为了产生每个链路的代价以获得更稳定的链路,调查了预测技术的使用·提出了一个基于运动预测机制的分布式成簇策略·仿真结果表明,该方法的稳定性优于最高连通度成簇算法HD和最低标识符成簇算法LCC·

关键词: 无线网络, 自组织网络, 成簇, 路由, 移动计算

Abstract: Describing briefly the characteristics of a mobile ad-hoc network or MANET and comparing them with related works, a new definition of time degree was given in view of the highly dynamic topology and absence of any fixed infrastructure in MANET. Analyzing the link relationship between two adjacent nodes, a network model based on the link life of the two nodes was set up. Some predicting techniques were investigated and used for the cost of each link so as to gain a more stable link. A distributed clustering algorithm is therefore proposed on the basis of a mobility prediction scheme. Simulation results showed that the algorithm proposed outperforms HD and LCC clustering algorithms.

中图分类号: