移动自组网基于邻居变化率稳定路径选择方法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant No.60403031(国家自然科学基金);the National High-Tech Research and Development Plan of China under Grant No.2005AA121560(国家高技术研究发展计划(863));the Fundamental Research Project of the Institute o


A Method of Selecting Steady Path Based on Neighbor Change Ratio in Mobile Ad Hoc Networks
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    节点移动是导致移动自组织网络性能下降、限制网络规模扩展的关键因素之一.寻找稳定路径是减小节点移动影响的有效手段.现有的稳定路径寻找方法存在以下局限:需要节点具有地理位置定位的硬件功能支持,或需要信号强度上传的交叉层功能支持.为此,提出了不需要特殊硬件支持、可独立于底层协议工作、基于邻居变化率的稳定路径选择方法.以AODV(Ad hoc on-demand distance vector)按需路由协议为基础,扩展为NCR-AODV(Neighbor change ratio Ad hoc on-demand

    Abstract:

    Node mobility is one of the dominant factors causing decreased performance in mobile ad hoc networks and restricting network scalability. Selecting stable paths is an effective way to reduce the impact of node mobility. Current methods of selecting stable paths in mobile ad hoc networks suffer from several shortcomings. They may need a hardware function support for geographical position location or cross-layer function support for sending signal strength information to upper layers. In this paper, a new method of selecting stable paths based on the neighbor change ratio is proposed. Neither the special hardware support nor the cross-layer support is needed in this new method. NCR-AODV (neighbor change ratio Ad hoc on-demand distance vector) routing protocol is an extension of the AODV (Ad hoc on-demand distance vector) on-demand route protocol with the new method. The new protocol selects the path which has smaller hop counts and less local topology changes to forward data. The simulation results show that NCR-AODV protocol decreases the long path break probability and improves the network performance.

    参考文献
    相似文献
    引证文献
引用本文

蔡一兵,李海波,李忠诚,谢高岗.移动自组网基于邻居变化率稳定路径选择方法.软件学报,2007,18(3):681-692

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2005-11-30
  • 最后修改日期:2006-06-09
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号