Research And Implementation Of MP2P Resource Location Technology Based On Internet Of Vehicles

In recent years,there are more and more cars in China,and the Internet of vehicles is gradually coming into people's vision.The resource download service provided by the Internet of vehicles is an important part of the Internet of vehicles.Because of the large number of vehicle nodes and high mobility in the Internet of vehicles,MP2P(mobile peer to peer)is more suitable for the Internet of vehicles than the traditional C / s resource download mode.MP2 P is a network model of computer nodes,each node is called a node,and each node provides data,storage and other services to each other.The resource location of MP2 P refers to the process of locating the target resource through a series of routing protocols when the node requests the resource in this network.First of all,this paper expounds the network structure of MP2 P based on the Internet of vehicles,studies the network characteristics and typical services of the Internet of vehicles and MP2 P,and expounds the network hierarchy structure of this scheme.This paper defines the mechanism and working mode of the protocol stack of wave(wireless access in vehicular environment)on the physical layer,data link layer and network layer,and combines the layering and coverage model of MP2 P to define the network structure of application layer and network layer.Then the resource location technology is studied.Resource location technology refers to the mechanism and algorithm used by a node in P2 P / MP2 P system from requesting resource to locating target resource node and establishing connection.This paper focuses on the research of Chord algorithm in P2 P and m-can algorithm in MP2P: chord has the advantages of simple structure,absolute convergence and stability,but the process of resource location will produce a lot of invalid query information,and when the node state changes frequently,it will reduce the efficiency;m-can can can obtain the resource information in the network by synchronizing the resource routing table of nodes in a small range When the resource request occurs,read the local information directly to find the IP address of the resource node and establish the link.However,when the number of nodes increases,a large amount of query information will be generated in the system,which wastes the network bandwidth.This scheme combines m-can and chord to establish a super node cluster.The super node collects all the resource information in the cluster.When the target resource is in the cluster,the m-can algorithm is used to locate it quickly.When the target resource is not in the cluster,the super node uses Chord algorithm to find another super node holding the resource.In order to optimize the efficiency of resource location of nodes in the cluster,the local resource index table,local information table and routing table are designed in each node,and mechanisms such as node update timestamp,interest item list and node movement vector are established.At last,the working modes of RSU(road test unit)and OBU(on-board node)and tracer server in the software design are shown,and the workflow of each module in the node joining / exiting,resource request and downloading is shown.Through the simulation test of the system,through downloading various resources under different node numbers,and comparing the performance of energy efficiency and accuracy under chord and m-can technology,to prove that the resource sharing system is superior to chord and m-can technology in data transmission time,efficiency,network data expenditure and accuracy.