Search

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. [ABSTRACT FROM AUTHOR]

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.

With the increasing number of Connected and Autonomous Vehicles (CAVs), the heterogeneous traffic flow on highways now consists of a mix of CAVs and Non-networked Autonomous Vehicles (NAVs). The current deployment of Roadside Units (RSUs) on highways is mostly based on uniform or hotspot locations. However, when the permeability of CAVs on the road varies, the communication network may face challenges such as excessive energy consumption due to closely spaced RSU deployments at high CAV permeability or communication interruptions due to widely spaced RSU deployments at low CAV permeability. To address this issue, this paper proposes an improved D-LEACH clustering algorithm based on vehicle clustering; analyzes the impact of RSU and vehicle communication radius, mixed traffic density, and different CAV permeabilities in the heterogeneous traffic flow on the RSU deployment interval; and calculates the rational and effective RSU deployment interval schemes under different CAV permeabilities on highways in the heterogeneous traffic flow. When the heterogeneous traffic flow density is stable and CAV continues to penetrate, the RSU communication radius and deployment interval can be adjusted to ensure that the network connectivity is maintained at a high level. When the RSU and vehicle communication radius are stable, the mixed traffic density is 0.05, and the CAV permeability is 0.2, the RSU deployment interval can be set to 1235 m; when the mixed traffic density is 0.08 and the CAV penetration rate is 0.7, the RSU deployment interval can be set to 1669 m to ensure that the network connectivity is maintained at a high level. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a type of mobile ad hoc network that forms a unified wireless communication network between vehicles and roadside nodes. Roadside units (RSUs), as the infrastructure and key component of VANETs, play a critical role in improving the performance of VANETs. Their deployment can effectively improve the communication performance of the network. The goal of the RSU deployment (RSUD) problem is to install as few RSUs as possible on both sides of roads or intersections so that they can cover most areas and achieve better communication performance. This paper proposes a multi-objective optimization model to solve the RSUD problem using the characteristics of RSUDs on urban roads. Our optimized target includes three performance indicators, which are the deployment cost of RSUs, their coverage area, and communications. Since these three indicators cannot achieve consensus, this paper proposes a multi-objective evolutionary algorithm, the NSGA-II Pareto optimal solution, to solve the RSUD problem. The simulation results show the effectiveness of the multi-objective model and method. Finally, we present an experiment featuring RSU deployment that is based on a real traffic environment and uses OpenStreetMap; this experiment proves that our proposed method is practical. [ABSTRACT FROM AUTHOR]

Abstract It is expected that for a long time the future road traffic will be composed of both regular vehicles (RVs) and connected autonomous vehicles (CAVs). As a vehicle-to-infrastructure technology dedicated to facilitating CAV under the mixed traffic flow, roadside units (RSUs) can also improve the quality of information received by CAVs, thereby influencing the routing behavior of CAV users. This paper explores the possibility of leveraging the RSU deployment to affect the route choices of both CAVs and RVs and the adoption rate of CAVs so as to reduce the network congestion and emissions. To this end, we first establish a logit-based stochastic user equilibrium model to capture drivers’ route choice and vehicle type choice behaviors provided the RSU deployment plan is given. Particularly, CAV users’ perception error can be reduced by higher CAV penetration and denser RSUs deployed on the road due to the improved information quality. With the established equilibrium model, the RSU deployment problem is then formulated as a mathematical program with equilibrium constraints. An active-set algorithm is presented to solve the deployment problem efficiently. Numerical results suggest that an optimal RSU deployment plan can effectively drive the system towards one with lower network delay and emissions.

It is expected that for a long time the future road traffic will be composed of both regular vehicles (RVs) and connected autonomous vehicles (CAVs). As a vehicle-to-infrastructure technology dedicated to facilitating CAV under the mixed traffic flow, roadside units (RSUs) can also improve the quality of information received by CAVs, thereby influencing the routing behavior of CAV users. This paper explores the possibility of leveraging the RSU deployment to affect the route choices of both CAVs and RVs and the adoption rate of CAVs so as to reduce the network congestion and emissions. To this end, we first establish a logit-based stochastic user equilibrium model to capture drivers' route choice and vehicle type choice behaviors provided the RSU deployment plan is given. Particularly, CAV users' perception error can be reduced by higher CAV penetration and denser RSUs deployed on the road due to the improved information quality. With the established equilibrium model, the RSU deployment problem is then formulated as a mathematical program with equilibrium constraints. An active-set algorithm is presented to solve the deployment problem efficiently. Numerical results suggest that an optimal RSU deployment plan can effectively drive the system towards one with lower network delay and emissions. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a type of mobile ad hoc network that forms a unified wireless communication network between vehicles and roadside nodes. Roadside units (RSUs), as the infrastructure and key component of VANETs, play a critical role in improving the performance of VANETs. Their deployment can effectively improve the communication performance of the network. The goal of the RSU deployment (RSUD) problem is to install as few RSUs as possible on both sides of roads or intersections so that they can cover most areas and achieve better communication performance. This paper proposes a multi-objective optimization model to solve the RSUD problem using the characteristics of RSUDs on urban roads. Our optimized target includes three performance indicators, which are the deployment cost of RSUs, their coverage area, and communications. Since these three indicators cannot achieve consensus, this paper proposes a multi-objective evolutionary algorithm, the NSGA-II Pareto optimal solution, to solve the RSUD problem. The simulation results show the effectiveness of the multi-objective model and method. Finally, we present an experiment featuring RSU deployment that is based on a real traffic environment and uses OpenStreetMap; this experiment proves that our proposed method is practical.

The deployment of Roadside Units (RSUs) in the Cellular-Vehicle to Everything enabled Internet of Vehicles is crucial for the transition from individual intelligence of vehicles to collective intelligence of vehicle-road collaboration. In this paper, we focus on improving the adaptability of RSU deployment to real scenarios, and optimizing deployment costs and vehicle-oriented service performance. The RSU deployment problem is modeled as a Multi-objective Optimization Problem (MOP), with a cost model integrating the purchase and installation costs, and a service-oriented Quality of Service (QoS) model adopting the total time the RSUs cover the vehicles as the evaluation metric. Specifically, we propose an RSU reliable coverage analysis method based on Packet Delivery Ratio model to estimate the coverage distances in different scenarios, which will be used in QoS calculation. Then, an evolutionary RSU deployment algorithm is designed to solve the MOP. The performance of the proposed method is simulated and discussed in real road network and dynamic scenarios. The results prove that our method outperforms the baseline method in terms of significant cost reduction and total coverage time improvement. [ABSTRACT FROM AUTHOR]