一种分布式竞争转发的VANET路由算法

A VANET Routing Algorithm Based on Distributed Competitive Forwarding

在节点密度变化频繁且高速移动的车联网环境中,传统AODV算法采用洪范广播RREQ机制寻找路由,网络拓扑变化较快且链路易断裂,节点密度较大时容易造成广播风暴,降低网络性能。针对上述问题,提出一种改进的分布式竞争转发PLPB-AODV算法。该算法在广播报文中嵌入网络收集到的节点位置与局部拓扑信息,以帮助中继节点获得先验拓扑结构来计算转发概率;针对网络节点非均匀分布特性,提取局部拓扑中心与边缘特征信息,辅助中继节点对转发概率进行调整。NS-3仿真结果表明,上述算法能够很好的适应节点密度变化较大且节点分布不均匀的网络环境,降低了网络端到端时延,具有较高的数据包分组投递率,提高了网络性能。

In the Internet of Vehicles environment where the node density changes frequently and moves at a high speed,the traditional AODV algorithm uses the flooding broadcast RREQ mechanism to find the route.The network topology changes rapidly and the chain is easy to break.When the node density is large,it is easy to cause broadcast storms and reduce the network performance.To solve these problems,an improved distributed competitively forwarding PLPB-AODV algorithm is proposed.The algorithm embeds the node location and local topology information collected by the network in the broadcast message to help relay nodes obtain a prior topology to calculate the forwarding probability.According to the non-uniform distribution of the network,the edge and center characteristics of the local topology are extracted to assist the relay node in adjusting the forwarding probability.The NS-3 simulation results show that the algorithm can adapt to the network environment where the node density changes greatly and the nodes are distributed unevenly,reduce the network end-to-end delay,have a high packet delivery rate,and improve the network performance.