Research And Design Of RSU Deployment Plan In Urban

With the rapid development of the automobile manufacturing industry and the rapid increase in the number of car ownership,urban road traffic problems seriously affect people’s travel comfort and security,making the original convenient and fast traffic overwhelmed.The emergence of VANET can effectively alleviate these problems,but it requires a large number of RSU deployments and high input costs.This thesis focuses on the low-cost deployment of urban RSUs and the connection between RSUs.First of all,this thesis analyzes the two main transmission modes of Vehicular Network and compares the advantages and disadvantages of data transmission between two modes of the Vehicular Network.In combination of these two modes,it proposes to use IEEE802.11p to transmit safety messages and use LTE to transmit non-safety messages.It makes the respective advantages of the two modes fully utilized.Simulation results show that the overall performance of the network has been doubled.Secondly,aiming at solving the problem of location selection of urban RSU in IEEE 802.11p transmission mode,a low cost and high coverage dominant location selection scheme is proposed.Based on the RSU coverage radius,the distance between locations,and the traffic volume at the location,the solution converts the site selection problem into the minimum dominating set to determine the optimal location of the final RSU in the urban area.Simulation results show that under the condition of [0,10]km2 of urban map,the radius of RSU coverage is 0.5km,the number of RSU required by the dominant deployment scheme is less than half in uniform deploymant,and it is 10% less than that of the hotspot deployment scheme.the cost more lower.As the coverage area continues to expand,the advantages of a dominant solution become more apparent.Subsequently,the dominant algorithm(DA) algorithm used in the dominating scheme was compared with the greedy algorithm(GA) and the balloon expansion algorithm(BEH) to verify the performance advantages of the DA algorithm.Finally,aiming at the problem of routing between RSUs after the location of urban RSU is determined,this thesis introduces a ring connection scheme based on minimum spanning tree greedy criterion.This scheme considers the cost factor and robustness of the overall network,making the RSU wiring more in line with the real environment.The simulation results show that the ring connection scheme is lower in cost than the mesh connection scheme.Although slightly higher than the tree connection scheme,the ring connection scheme is better than the tree connection scheme in terms of network robustness.Integrated into cost-effectiveness is robust and cost ratio,and the ring connection scheme has more advantages.