系统仿真学报 ›› 2017, Vol. 29 ›› Issue (6): 1260-1267.doi: 10.16182/j.issn1004731x.joss.201706014

• 仿真系统与技术 • 上一篇    下一篇

基于速度感知的MANET概率路由

陈耀华1, 彭凌西2, 古鹏2   

  1. 1.广州大学机械与电气工程学院,广东 广州 510006;
    2.广州大学计算机科学与教育软件学院,广东 广州 510006;
  • 收稿日期:2015-07-20 修回日期:2015-12-13 出版日期:2017-06-08 发布日期:2020-06-04
  • 作者简介:陈耀华(1979-),男,广东广州,硕士生,实验师,研究方向为微型计算机控制技术与无线电传感技术。
  • 基金资助:
    国家自然科学基金 (61100150),广州市教育局科技项目 (2012A077)

Speed-aware-based Reliable Probabilistic Route in MANET

Chen Yaohua1, Peng Lingxi2, Gu Peng2   

  1. 1. School of Mechanical & Electric Engineering, Guangzhou University, Guangdong 510006, China;
    2. School of Computer Science and Educational Software, Guangzhou University, Guangdong 510006, China
  • Received:2015-07-20 Revised:2015-12-13 Online:2017-06-08 Published:2020-06-04

摘要: 针对移动自组网(Mobile Ad Hoc Network,MANET)中路由的广播风暴问题,提出了基于速度感知的可靠的概率路由发现(Speed-aware-based reliable probabilistic route discovery,SRPR)方案。SRPR方案利用节点的速度矢量信息,将节点划分为可靠节点和非可靠节点。再利用贪婪转发策略,将可靠节点集中选择离目标节点最近的节点赋予高的转发概率,进而提高路由的可靠性,降低路由跳数。将SPRP方案应用于典型的按需式距离矢量路由协议(Ad Hoc On-demand Distance Vector,AODV)进行仿真。仿真结果表明,提出的SPRP方案能够有效缓解广播风暴问题,降低控制包(Routing requests,RREQ)的重传次数,并减少碰撞率。

关键词: 移动自组网, 概率路由, 速度, 贪婪转发, 按需式距离矢量路由

Abstract: For broadcast problem of routing in MANET, speed-aware-based reliable probabilistic route discovery (SRPR) scheme was proposed. SRPR considered speed vector and all nodes were divided into reliable nodes and un-reliable nodes. A node among reliable nodes closest to destination was assigned a high probabilistic routing decision by greedy forwarding strategy. The reliability of routing was improved and the number of routing hop was reduced by SRPR scheme. Ad Hoc On-demand Distance Vector (AODV) routing was adopted in the experiments. Simulation results show that the proposed routing protocol mitigates the broadcast storm problem and outperforms in term of number of re-transmission collision ratio of RREQ.

Key words: MANET, probabilistic route, speed, greedy forwarding, ad hoc on-demand distance vector routing

中图分类号: