Research On QoS Routing Algorithm Of Vehicle Ad Hoc Network Based On Coevolution

With the popularity of vehicles and the development of wireless communication,vehicular ad hoc network VANET has been widely used,but vehicular ad hoc network needs to provide network quality of service(QoS)to meet the needs of network applications.The high-speed movement of vehicles leads to the dynamic change of network topology of vehicle ad hoc network.In addition,vehicle ad hoc network usually presents high density and uneven distribution of network nodes;These factors are not conducive to the rapid discovery of appropriate routes,which affects the QoS performance of vehicle network.Therefore,it is necessary to find QoS routing algorithm suitable for vehicle network dynamic topology and complex network environment,which is of great significance to improve the application performance of vehicle ad hoc network.This paper introduces a new coevolution technology and proposes a QoS routing algorithm for vehicle ad hoc network based on coevolution.The main work includes the following two aspects.1.This paper proposes a constrained cooperative co evolution QoS multi-objective unicast routing(CCUR)algorithm for vehicular ad hoc networks.By introducing a local search strategy,a constrained cooperative coevolution algorithm is proposed.Through dual population evolution and local search strategy,the optimization speed and convergence accuracy of the algorithm are enhanced.Constrained cooperative coevolution algorithm can better deal with the multi-objective QoS constraints in unicast routing,and adapt to the dynamic and complex network environment of vehicle ad hoc network,so as to improve the convergence speed and accuracy in finding the optimal QoS unicast routing scheme.Comparing ccur with the three comparison algorithms on eight vehicular ad hoc networks,ccur can obtain a better routing scheme.At the same time,ccur also shows better multi-objective optimization performance in multi-objective evaluation indexes such as super volume HV,reverse generation distance Ig D and generation distance GD.2.This paper proposes a structural competition co evolution multicast routing(CCMR)algorithm to solve the problem of QoS multi-objective multicast routing in vehicular ad hoc network.The population individual of CCMR algorithm is one of the multicast trees in the target network.The population is divided into two sub populations LP and GP.For different optimal multicast tree structures,they use local operation and global operation strategies to generate the individuals of the next-generation multicast tree group respectively.They use the competitive collaborative advancement mechanism to exchange information between the two sub populations through selection and fusion,and finally obtain the optimal multicast tree through generation by generation evolution.The above co evolution mechanism within and between populations increases the diversity and randomness of the population,so as to improve the search ability of the algorithm,make the algorithm jump out of the local optimization and obtain good convergence accuracy and speed.Eight vehicular ad hoc network scenarios are adopted,and three comparison algorithms are introduced.Experiments show that CCMR has excellent performance in three QoS indexes: power consumption,delay and packet loss rate.At the same time,the performance of multi-objective evaluation indexes HV,Ig D and Gd is also better than the comparison algorithm,which further verifies that CCMR algorithm is competitive in maintaining convergence and diversity.