Research On Authorized Vehicle Selection And Resource Cache In Vanets

With the rapid development of the Internet,the resources in the network are becoming more and more abundant,the number of users in the wireless mobile network is increasing,and the requirements for the wireless network are getting higher and higher.In order to relief the network congestion and improve the quality of the user's online experience,caching resources in the network agents is a hot research topic in recent years.particularly,the selection of suitable network agents and resources to be cached is the focus of current research.In wireless mobile networks,many literatures consider vehicles as network agents and cache resources in the vehicle.However,when selecting vehicles and cache files,it is unrealistic to regard the storage capacity of vehicles as infinite and the size of each file as the same.This paper aims at improving the two problems and proposes a new cache algorithm.The main contents are as follows:Firstly,when selecting a vehicle as a network agent,four factors of the vehicle's trajectory distance,number of service vehicles,storage capacity,and vehicle spacing are taken as important reference indicators.In fact,the storage capacity of vehicles is limited,and the storage capacity of each vehicle is different,because the vehicles are produced by different automobile manufacturers,these vehicles will have different computing power,storage capacity,communication capabilities,and these factors are regard as the important reference indicators of network agents,however,only the storage capacity is considered in this paper.In this paper,vehicles are clustered based on their driving trajectory and AP clustering algorithm.Then,the newly proposed combined weight allocation method is used to assign weights to the four factors of vehicles,and the vehicles with the highest comprehensive score are selected as network agents.Secondly,when caching files,the files are ranked according to the popularity of the files,and the size of each file is different.In order to cache the files with the largest total value and the most likely access by users to the agent vehicle,this paper proposes an algorithm for caching files,which is called pre-filtering genetic algorithm.Finally,the new algorithm proposed in this paper is simulated experimentally,and the cache hit ratio,time delay,total value of cache and so on are compared and analyzed.The simulation results show that the algorithm proposed in this paper is more excellent.