Research On Resource Allocation Algorithm Of IoV Based On LTE-V

Long Term Evolution-Vehicle to Everything(LTE-V2X)is one of the international mainstream standards of Internet of Vehicle(Io V),and its resource allocation methods are centralized(Mode 3)and distributed(Mode 4).The purpose of the resource allocation algorithm is to effectively avoid resource collisions,reduce interference,and improve the reliability of vehicle to vehicle(V2V)communication.In this thesis,according to the 3rd generation partnership project(3GPP)proposal given two typical high-speed roads and urban roads in the Io V scenario,the problems such as interference,resource block conflicts,hidden nodes and so on in the resource allocation algorithm are discussed,and the corresponding problem solving strategies are given and verified by simulation.The main work of this thesis is as follows:Aiming at the problem of interference and uncertainty of resource reselection occur in highway scenes.In this thesis,the idea of grouping is used.According to the direction of the highway,the resource pool is divided into two sub-resource pools in advance to reduce the interference caused by vehicles in different directions as transmitters.In the resource reselection phase of the sensing based semi persistent scheduling(SSPS)algorithm,in order to reduce the uncertainty in resource selection in the sub-resource pool,each resource block carries location information.By exchanging the location information piggybacked on the periodic safety message,vehicular user equipment(VUE)can eliminate most message collisions arising from the ignorance of other VUEs’ internal decisions.In this way,resource conflicts are reduced during reselection.Aiming at the problems of hidden nodes and In Band Emission(IBE)occur in urban road scenes.This thesis proposes a resource allocation algorithm based on geographic location,which establishes a mapping relationship between a certain area where a vehicle is located and a resource pool.VUEs in different areas use different sub-resource pools to solve hidden node and IBE problems.However,this algorithm is affected by the uneven distribution of vehicle density.In this thesis,a resource allocation algorithm for dynamic geographic location is designed.The optimal geographic area pair is selected by breath first search(BFS)and resource reuse,and the congested area is mapped to a larger sub-region resource pool to meet the resource selection problem of VUE in different density areas and reduce the resource collision problem of VUE in different density areas.Finally,this thesis models highway roads and urban roads and builds a simulation platform.By comparing the simulation results such as packet reception rate(PRR)under different resource allocation algorithms,the proposed algorithm is used to verify the system performance gains.