Research On Routing Method Of Internet Of Vehicles Based On Geographical Location

At the beginning of the birth of the Internet of Vehicles,it aimed to provide drivers and passengers with a safe and comfortable service experience.It was to solve problems such as difficult transportation and environmental pollution caused by exhaust emissions.The Internet of Vehicles is the cornerstone of building a smart and interconnected city,and it is also a new infrastructure area that the state focuses on.However,the high-speed dynamics of the nodes in the Internet of Vehicles and the frequent and rapid changes in the topology make it face many challenges.Among them,the establishment of stable and reliable routing is one of its main challenges.Starting from the traditional greedy forwarding routing protocol based on geographic location,this thesis proposes a weighted routing protocol based on geographic location(W-GPCR).The main research contents are as follows:(1)According to the greedy forwarding strategy,the next hop optimal relay node is selected,only the distance between nodes is considered,and other factors affecting the performance of the routing protocol are not considered.The node movement direction and node density are introduced,and a formula for calculating the comprehensive weight of a node,which selects the optimal next-hop relay node by calculating the comprehensive weight,which reduces the limitation of routing selection to a certain extent;(2)When the repair strategy is to deliver data packets according to the right-hand rule,routing loops and data packet delivery may be far away from the target node.The delivery direction of the data packet is used as the main indicator,and the distance between nodes and node density are used as auxiliary Indicators,a formula for calculating the weight is designed.The node with the largest weight will be selected as the next hop node,which can effectively solve a series of problems accompanying the delivery of data packets according to the right-hand rule;(3)Aiming at the problem that occasional routing holes in sparse networks can easily lead to routing deaths,a routing restoration strategy is proposed.A weight calculation formula is designed to select the next hop node by calculating the weight of the node,which can avoid the dilemma of data packet delivery falling into the routing hole again,and find other potential paths to deliver the data packet to the target node,which enhances the routing protocol Reliability.The simulation results show that the W-GPCR routing protocol is better than GPSR,GPCR,Gpsr J+,GCRP in terms of packet delivery rate,end-to-end delay and average number of hops.Finally,this thesis also discusses the implementation method of the W-GPCR routing protocol in the project,and gives the specific steps of routing optimization,as well as the data interaction steps and processes.The network experiment was carried out with a real vehicle,and the experiment verified the rationality and effectiveness of the W-GPCR routing protocol proposed in this thesis.