基于按需和贪婪转发的移动自组网路由协议

Routing protocol for mobile ad hoc networks based on on-demand and greedy forwarding

  • 摘要: 移动自组网的动态拓扑特性给路由协议的设计带来了一定的挑战,尤其是在高动态的网络环境中.本文针对该问题,提出了一种新的基于按需和贪婪转发的路由协议,该协议是在RGR模式的基础上提出以下三点改进,即:(1)通过受限的洪泛机制降低网络在路由发现阶段的控制开销;(2)通过移动预测机制,在被动寻路阶段监视被动路径的状态和在GGF阶段帮助节点选取适当的邻居作为下一跳节点;(3)通过路径请求延迟机制以减少不必要的资源浪费.仿真结果表明:改进的RGR协议与现有的RGR、AODV、Modified-RGR和Optimized-RGR相比,不仅具有较高的数据包接收成功率,而且平均路由开销和端到端时延也相对较低.

     

    Abstract: The dynamic topology of a mobile ad hoc network poses a real challenge when designing the routing protocol, especially in high-dynamic environments. In this paper, a new routing protocol was proposed that is based on on-demand and greedy forwarding. This protocol proposes three opinions to RGR, i.e., through scoped flooding to decrease control overhead in route discovery phrase, through mobility prediction to monitor the condition of the reactive path and help nodes choose the proper next-hop in the GGF phrase and through delayed route requests to reduce unnecessary waste of network resources. In contrast to RGR, AODV, Modified-RGR, and Optimized-RGR simulation, the results show the improved RGR not only has a high packet acceptance ratio, but has a low normalized routing overhead and an average end-to-end delay.

     

/

返回文章
返回