面向车载网络改进的GPSR路由算法

An Improved GPSR Protocol for VANETS

针对车载网络GPSR的路由空洞问题,分析了现有策略的不足。为此,提出改进的GPSR路由算法。在改进的GPSR算法中,当节点已达到局部优化,即贪婪算法无法传递数据包,就利用邻居节点竞争方式转发数据包,并基于邻居节点的权值,选取最优的下一跳节点。仿真结果表明,改进的GPSR算法在数据传输率、端到端传输时延、路由长度方面均有较好的性能。

To dealt with routing void problem of Greedy Perimeter Stateless Routing （GPSR） in vehic ad hoc networks（VANETs） , shortages of methods handling routing void are analyzed. Therefore, the improved GPSR is proposed. When the node has reached the local optimization, namely the greedy algorithm cannot transfer packets, a node-priority forwarding strategy is used to forward the packet. The optimal next-hop is selected by the node -pri- ority of neighbor. Simulation results have shown that the proposed strategy is better performance in end to end de- lay, packet delivery success rate and routing path length.