基于WiFi的自组织网络路由协议算法研究

摘要

以基于WiFi的自组织网络为应用背景,本文利用仿真平台OPNET对四种经典自组网路由协议的性能进行了仿真比较。实验结果表明,反应式路由协议的性能总体优于先应式路由算法,而AODV协议由于其备份路由的特性,性能更优。为满足战场环境下车载自组织网的大规模组网要求,以及火控数据的时延传输要求,结合AODV算法的优势,本文提出了一种新的分层自组网路由算法CRP,其分簇结构的设计减少了网络拓扑变化对寻由过程的影响和路由发现过程中的洪泛开销,加速了路由的查找过程,仿真结果显示该算法的综合性能优于AODV算法及经典分簇路由协议ZRP算法,端到端传输时延明显减小。%Taking WiFi-based Ad-hoc network as an application background, the performance of 4 typical Ad-hoc network route protocols are simulated and compared by using simulation platform OPNET. The experimental re-sult shows that reactive route protocol has a better performance than that of pre-active routing algorithm, and the AODV protocol has more excellent performance because of its characteristics of backup route. A novel cluster Ad hoc network route algorithm CRP is presented by combining advantages of AODV algorithm to meet the large scale netting requirement of vehicular Ad-hoc network under battlefield circumstance and time delay transmission re-quirement for the fire control data. Its cluster architecture design reduces effect of network topology changes on route searching process and flooding cost during route discovery process, and speed up the searching process of route. The simulated results indicate that the integrated performance of this algorithm is better than that of the AODV algorithm and typical clustering route protocol ZRP algorithm, and the end-to-end transmission time delay is reduced distinctively.