Related Experiment Video
Updated: Feb 6, 2026

Automated Deployment of an Internet Protocol Telephony Service on Unmanned Aerial Vehicles Using Network Functions Virtualization
Published on: November 26, 2019
Delay-Bounded and Cost-Limited RSU Deployment in Urban Vehicular Ad Hoc Networks
Huanhuan Yang1, Zongpu Jia2, Guojun Xie3
1School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454000, China. yanghh94@home.hpu.edu.cn.
This study introduces a novel algorithm for optimal roadside unit (RSU) deployment in vehicular ad hoc networks (VANETs). The method maximizes road coverage within budget and delay constraints, improving network performance.
Area of Science:
- Computer Science
- Network Engineering
- Transportation Systems
Background:
- Vehicular ad hoc networks (VANETs) benefit from roadside units (RSUs) for improved performance.
- High deployment costs and network limitations necessitate strategic RSU placement.
Purpose of the Study:
- To address the delay-bounded and cost-limited RSU deployment (DBCL) problem in urban VANETs.
- To maximize road coverage while adhering to deployment constraints.
Main Methods:
- Developed a binary differential evolution scheme for RSU placement optimization.
- Incorporated opposite-based learning, a novel mutation operator, and a greedy repair algorithm.
- Enhanced population diversity using a modified crossover operator and a solution promotion algorithm.
Main Results:
- The proposed algorithm effectively maximizes road coverage for RSU deployment.
- Achieved a higher road coverage ratio compared to existing schemes.
- Demonstrated lower packet loss in simulations.
Conclusions:
- The developed algorithm provides an effective solution for the NP-hard DBCL problem.
- Offers a practical approach for cost-effective RSU deployment in urban VANETs.
- Improves overall network efficiency and reliability.
Related Concept Videos
Limiting Reactant
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
The Number e as a Limit
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Types of Limits I
Limit Laws I

