作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (11): 123-125,128. doi: 10.3969/j.issn.1000-3428.2011.11.042

• 网络与通信 • 上一篇    下一篇

一种基于邻接信息表的动态源路由协议

曹民强1,2,焦臻桢1,2,蒋同海1,张 岩1,曾文潇1   

  1. (1. 中国科学院新疆理化技术研究所,乌鲁木齐 830011;2. 中国科学院研究生院,北京 100080)
  • 收稿日期:2010-11-09 出版日期:2011-06-05 发布日期:2011-06-05
  • 作者简介:曹民强(1985-),男,硕士研究生,主研方向:无线传感器网络;焦臻桢,硕士研究生;蒋同海,研究员、博士生导师;张 岩,高级工程师;曾文潇,助理研究员、博士研究生

Dynamic Source Routing Protocol Based on Adjacency Information Table

CAO Min-qiang  1,2, JIAO Zhen-zhen  1,2, JIANG Tong-hai  1, ZHANG Yan  1  , ZENG Wen-xiao  1   

  1. (1. Xinjiang Technical Institute of Physics & Chemistry, Chinese Academy of Sciences, Urumqi 830011, China; 2. Graduate University of Chinese Academy of Sciences, Beijing 100080, China)
  • Received:2010-11-09 Online:2011-06-05 Published:2011-06-05

摘要: 针对动态源路由(DSR)协议在Ad Hoc网络拓扑结构频繁变化时表现欠佳的问题,在DSR协议的基础上引入邻接信息表概念,提出基于邻接信息表的动态源路由协议AIT-DSR。该协议可以加速路由发现,纠正路由绕远,规避高负载节点,快速修复失效路由,降低网络丢包率和平均端到端延时。仿真结果表明,在节点快速移动的场景下,AIT-DSR协议的丢包率和平均端到端延时低于DSR协议。

关键词: Ad Hoc网络, 动态源路由协议, 路由发现, 邻接信息表, 延时

Abstract: Dynamic Source Routing(DSR) protocol is not quick enough to adapt to fast-changing topology of Ad Hoc network. To solve the problem, this paper introduces a conception of adjacency information table, presents a new protocol of DSR based on Adjacency Information Table(AIT-DSR). The protocol accelerates the route discovering, shortens the route, repairs the invalid route and avoids the high-load node. The packet loss rate and the average end-to-end delay decrease. It is proved by the results of simulation experiment.

Key words: Ad Hoc network, Dynamic Source Routing(DSR) protocol, route discovering, adjacency information table, delay

中图分类号: