Research On Geographical Location-based Routing Protocols In Internet Of Vehicles

The GPSR(Greedy Perimeter Stateless Routing)protocol is a geographic location-based routing protocol widely used in the Internet of Vehicles.This protocol only needs to save the state of neighbor nodes within one hop,compared to topology-based routing protocols and broadcast-based routing protocols.The routing protocol based on geographic location has the advantage of greatly reducing the routing protocol overhead.In the scenario where the network topology changes rapidly,the GPSR protocol only needs to make correct routing and forwarding decisions based on neighbor nodes within one hop,without relying on the structure of the entire network topology,which can effectively reduce link interruption.Probability.First,this paper proposes the MV-MA-GPSR(Max-stable-value-Min-angle GPSR)protocol.This protocol selects the first hop relay node of the source node according to the stable value of the node in the area called Io TC(Intersection of Two Circles),which can significantly reduce the high speed of the relay node due to the existence of the classic GPSR protocol.The probability of link interruption caused by the instantaneous movement of the source node beyond the one-hop communication range;combined with the application of the minimum angle algorithm,it can also reduce the probability of path redundancy in certain scenarios due to the use of the right-hand rule in the peripheral forwarding process of the classic GPSR protocol..Secondly,this paper proposes the AP-GPSR(Aware Path GPSR)protocol.The protocol introduces a Deny Table(DT)for the problem of path redundancy.The source node determined by the right-hand rule passes a neighbor node to a target node on a path that is unreachable from the neighbor node to the target node.For joining to the rejection table,it can effectively reduce the probability of path redundancy in the process of greedy forwarding;for the routing loop problem that may be caused during the peripheral forwarding process,another Recent Send Table(RST)is introduced,during the forwarding process,the data packets recently sent by the node are recorded in the RST,which can effectively prevent the routing loop problem;the relay node that enters the peripheral forwarding uses the left-hand and right-hand rules to forward the received data packets at the same time,which can reduce the path redundancy during the peripheral forwarding process.The probability of residual occurrence,meanwhile,the probability of path circulation occurring in the surrounding forwarding process is better than the GPSR protocol based on the maximum stable value and the minimum angle proposed previously.For the link interruption during the greedy forwarding process,the source node is based on the neighbor node The speed and direction of the motion can estimate the position of the neighbor node within a period of time,and select a stable neighbor node as the next hop relay node,which can reduce the probability of link interruption.Finally,through NS3 and SUMO simulation,the main performance indicators of the simulation are: packet delivery rate,throughput,end-to-end delay and average hops.We simulated three of our common traffic scenarios: highway scenes,urban scenes,and suburban scenes,and analyzed the performance of various protocols,and finally reached a conclusion.The packet delivery rate of our protocol has been significantly improved,indicating that the proposed algorithm can effectively reduce the probability of link interruption;the routing hops of our proposed protocol also have a certain reduction,indicating that the proposed algorithm can effectively reduce the probability of path redundancy.