Research And Application Of Vehicular Ad Hoc Network Routing Discovery Algorithm

In the world of today,science and technology change with each passing day.Rapid development is in every field.With the development of information and communication technology,the Internet of things comes into our field of vision.As an important part of intelligent transportation,vehicular ad hoc networks is one of them,and the study of vehicular ad hoc networks is becoming a hot spot of the present.Vehicular ad hoc networks is a branch of mobile ad hoc network.It is the product of the combination of communication technology and automotive technology.Mobile vehicles temporarily built a network,in order to realize the information interaction between vehicles,so as to provide owners with efficient and safe travel and all sorts of convenient services.A lot of applications are based on the application of vehicular ad hoc networks,such as vehicle navigation,emergency vehicle priority,avoiding collision in intersections,vehicle positioning,etc.This paper pays attention to communication between vehicles.Main research results are as follows:(1)We design a routing protocol based on clustering.VANETs can transmit data among vehicles in the absence of infrastructure.Good routing algorithm will improve the efficiency of data transmission.Clustering is considered to be an effective strategy to solve the routing problem between vehicles.Through clustering,the entire network presents a hierarchical structure.This structure can not only reduce the radio frequency in the process of route discovery,also provide convenience for data forwarding.Clustering needs a reasonable cluster head selection algorithm.This paper presents a cluster head selection strategy of combination weights.At the same time,after clustering,a scientific cluster maintenance mechanism is needed,which guarantees the stability of the cluster but reduces bandwidth consumption.This paper presents two methods of cluster maintenance for straight roads and intersections respectively.Especially in a intersection,cluster maintenance is very important.On the one hand,the cluster members change rapidly in the intersection,on the other hand forwarding data will accumulate in members in the intersection.Both need good coordination.When clustering is complete,one cluster connects another cluster by their common members-the gateway nodes.Routing discovery uses reactive routing strategy.That means routing discovery process performs when one vehicle has data to be sent.Data forwarding is based on the model of next hop.(2)Then,we realize the vehicle route planning based on clustering routing.In order to realize the vehicle navigation and emergency vehicle priority after the acquisition of real-time traffic information,such as density and traffic.In this paper,our plan is in the case of clustering in combination with geographical multicast.Vehicles which need navigation and passing priority send a multicast data packet to the specific fore area.The cluster heads in the area after receiving the packet send the vehicle information within the cluster to the vehicle,so that the vehicle has the vehicle state of the area.With this vehicle state database,the vehicle can use the shortest path algorithm to find the best route.The shortest path algorithm is based on dijkstra algorithm.In the case of a given source node and destination node,it will generate a complete path.Different with the dijkstra algorithm,it not only considers the weight of edge,but also considers node weights.In this paper,the algorithm is simulated in ns-2.The simulation results show that the strategy can achieve small data transmission delay and high delivery rate.At the same time,it allows the vehicle to find the best path...