Route Selection Algorithm For Vehicular Ad Hoc Networks

Vehicular ad hoc networks(VANETs)refers to a network system in which vehicles are mobile nodes and self-organized communication using auxiliary facilities such as on-board equipment,roadside units,and communication satellites.VANETs can improve the efficiency of transportation systems,provide users with security services and multimedia entertainment services,and it has received extensive attention.The routing technology in VANETs is responsible for finding the transmission path from the source vehicle(SV)to the destination vehicle(DV)for the packet of source vehicle,which has an important impact on the performance of the VANETs.Due to the high-speed mobility characteristics of the vehicle nodes,the frequent interruption of the link and the rapid change of the network topology bring certain challenges to the routing.In addition,with the rapid increase of the number of vehicle users and the higher demand for quality of service(QoS),the current traffic volume of communication has increased rapidly,and existing routing algorithms have been unable to meet the current demand.For the above problems,this paper studies the routing algorithm of VANETs,including the following:Firstly,the concept,system model and architecture of VANETs are introduced,then this paper carefully classifies and summarizes the existing routing methods about VANETs in recent years.Secondly,a route selection method based on end-to-end QoS performance optimization is proposed for the vehicle networking scene,which consists of a single SV,a single DV and multiple relay vehicles(RVs).Then comprehensiely considering the traffic features of SV and the data forwarding features of RVs,and the stochastic network calculation theory is applied to evaluate the delay and backlog of transmission of data packets sent by the SV through candidate links.Finally,the Dijkstra algorithm is used to obtain the optimal target route with the best end-to-end transmission performance between SV and DV.Again,for a cognitive Vehicular Network scenario,which consists of with a single SV and DV cognitive user pair,multiple RVs cognitive users,and multiple primary users,this chapter proposes a cognitive Vehicular Network joint routing and resource allocation method.This method considers factors such as sub-channel characteristics,channel handover times limit,and successful transmission of data packets of SV,and models theoptimization of joint routing and resource allocation optimization based on end-to-end transmission delay optimization.Then,the optimization problem is equivalently converted into two sub-problems,namely candidate link resource allocation sub-problems and routing sub-problems,and two optimization problems are solved based on the K shortest path algorithm and Dijkstra algorithm respectively to obtain the optimal joint routing and resources allocation strategy.Finally,summarize the research content of this thesis,and look forward to possible future research directions.