一种适合于移动Ad Hoc网络的路由协议WPRP

针对无线Ad Hoc网络特点,提出了一种无线路径发现路由协议(Wireless Path Finding Routing Protocol,WPRP)。对WPRP协议进行了简要概述,分别介绍了采用最短路径算法(Short Path Algorithm,SPA)查找最短路径;递归环路检测算法(Recursive Loop Check Algorithm,RLCA)消除路由环路;路由校验实现节点间路由同步;自适应时间调节机制进一步减少网络冲突、降低网络开销等方法以及实现过程。OPNET仿真结果表明,与OLSR协议相比,WPRP具有较小的路由开销和较快的收敛速度,是一种动态路由协议,适用于无线Ad Hoc网络。

A Suitable Routing Protocol WPRP for Mobile Ad Hoc Network

In accordance with the characteristics of wireless Ad Hoc network,a wireless path routing protocol WPRP(Wireless Path Finding Routing Protocol)is proposed.A brief overview of WPRP is provided,then some methods and their implementation processes are introduced,such as the short path algorithm(SPA)to find the shortest path,the recursive loop check algorithm(RLCA)to eliminate routing loops,the routing checking to achieve node route synchronization,and the adaptive time-adjustment mechanism to further reduce network conflicts and overhead.The OPNET simulation results show that WPRP,as compared with OLSR protocol,is a dynamic routing protocol with smaller routing overhead and fast convergence rate,and it is suitable for wireless Ad Hoc network.