Routing method based on three-dimensional scene in vehicle self-organizing network

Abstract

The invention discloses a routing method based on a three-dimensional scene in a vehicle self-organizing network. The routing method mainly solves the problem that performance of an exiting routing method of the vehicle self-organizing network in the three-dimensional scene is reduced. The routing method includes the steps of firstly, selecting destination crossing determining methods through grouped nodes to be sent according to the position conditions and determining the destination crossings; secondly, forwarding grouped nodes to be forwarded with the destination crossings serving as destinations, and determining the forwarded nodes according to the virtual distance obtained through calculation; thirdly, judging whether the forwarded nodes are destination nodes or not, if yes, terminating the routing process, and if not, judging whether the forwarded nodes are located at the destination crossings or not, selecting the destination crossings again if the forwarded nodes are located at the destination crossings, and grouping and forwarding the nodes if the forwarded nodes are not located at the destination crossings. By means of the method, the number of jumping times of a router and the communication time delay are reduced, the overall performance of the router is improved, and the method can be used for data transmission in the three-dimensional scene in the VANET.

Description

technical field [0001] The invention belongs to the technical field of communication, and mainly relates to a routing method in a three-dimensional scene, which can be used in a vehicle self-organizing network VANET. Background technique [0002] Vehicle Ad Hoc Network VANET is an ad hoc network composed of distributed vehicle equipment, namely mobile nodes. In VANET, the communication between these vehicle devices is not carried out with the help of fixed infrastructure, but is realized through the forwarding of other vehicle devices. In order to improve the safety and convenience of vehicle travel, it requires the realization of communication between long-distance vehicle equipment. Due to the limited wireless transmission distance, one-hop transmission cannot meet such requirements, and multi-hop transmission needs to be realized, which involves the routing problem of multi-hop transmission. How to design an efficient routing method to send data to the destination succe...

AI Technical Summary

Problems solved by technology

However, the hops of the route found by the TDR method are not necessarily optimal.

The reason is that, in such a situation, the projected distance d of the distance between the farthest neighbor node and the central node on the road in the road section direction of different layers inter-layer It is greater than the projection distance d of the distance between the furthest neighbor node and the central node on the same road in the direction of the road section layer , the packet is forwarded through the furthest neighbor nodes on different layers of roads, and the farthest two-hop distance that can be reached is d inter-layer +R, where R is the one-hop transmission range of the same-layer transmission, and at the same time, the farthest two-hop distance that the packet can reach through the farthest neighbor node on the same-layer road is d layer +R, the former is obviously greater than the latter, that is to say, the same-layer transmission priority TDR method cannot obtain the route with the optimal hop number in the above situation, that is, the packet cannot be transmitted within a certain distance with the shortest hop number

Therefore, the TDR method has the problems of many routing hops and large transmission delay, which makes the quality of the communication link in the 3D scene low and the overall performance of the routing is not good.

Images