A New Hybrid Hierarchical Roadside Unit Deployment Scheme Combined with Parking Cars

This paper proposes a new hybrid hierarchical roadside unit (RSU) deployment algorithm that combines traditional RSU deployment strategies with temporary RSUs (t-RSUs) selected from many parked vehicles. The driving vehicles in the corresponding RSU coverage section are divided into clusters and the demand is thus summarized. We first solve the problem of how to choose the appropriate cars serving as t-RSUs and then optimize the RSU deployment with the dynamic existing t-RSUs. We simulate the deployment application in a downtown area of Shanghai, China, using the simulation of urban mobility (SUMO), version 1.11.0, an open-source traffic simulation package, and its traffic-control interface (TraCI) with Python. The simulation results show that, within a given economic cost, the proposed hybrid hierarchical RSU deployment algorithm outperforms the maximum vehicle coverage deployment algorithm (MVCD) and the random deployment algorithm (RandDeploy) in terms of overall vehicle coverage and point-to-point vehicle connectivity ratio. Our scheme provides new solutions and ideas for the deployment of RSUs in future urban traffic environments.