A VANET Routing Algorithm Based on Distributed Competitive Forwarding
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 proba-bility.According to the non-uniform distribution of the network,the edge and center characteristics of the local topol-ogy 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 dis-tributed unevenly,reduce the network end-to-end delay,have a high packet delivery rate,and improve the network performance.
NETL
NSTL
万方数据
