Low-power-consumption road side unit deployment strategy for urban 2-D 5G Internet of vehicles

In urban Internet of vehicles (IoV) systems, the road side unit (RSU) was commonly deployed at road intersections to provide two-dimensional service coverage. However, due to vehicle dynamics, RSU might suffer from massive power waste. A novel RSU deployment strategy was proposed that dynamically adjusted the operating mode and transmission power of RSU, based on the spatial distribution of vehicles. An adaptive mapping mechanism between RSU power consumption and vehicle distribution patterns was established that overcame the power consumption bottleneck caused by traditional RSU's fixed coverage to minimize the total power consumption of RSU. Furthermore, the concept of candidate communication service area (CCSA) was introduced, utilized in combination with an exploratory RSU deployment algorithm (ERDA) and an enhanced genetic algorithm (eGA) to implement the RSU deployment strategy. Analysis and simulation results indicate that, compared with conventional methods, the proposed RSU deployment stra-tegy significantly reduces redundant road coverage, leading to minimized RSU power consumption. In low vehicle density, the ERDA can achieve optimal solutions with low computational complexity. In high vehicle density, the eGA provides a reasonable balance between complexity and performance. Therefore, the proposed strategy provides practical engineering guidance for urban transportation systems.

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-04-01
Primary Topic
Particle Detector Development and Performance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low-power-consumption road side unit deployment strategy for urban 2-D 5G Internet of vehicles

SHILAP Revista de lepidopterología
Particle Detector Development and Performance
article

Low-power-consumption road side unit deployment strategy for urban 2-D 5G Internet of vehicles

article en

Abstract

In urban Internet of vehicles (IoV) systems, the road side unit (RSU) was commonly deployed at road intersections to provide two-dimensional service coverage. However, due to vehicle dynamics, RSU might suffer from massive power waste. A novel RSU deployment strategy was proposed that dynamically adjusted the operating mode and transmission power of RSU, based on the spatial distribution of vehicles. An adaptive mapping mechanism between RSU power consumption and vehicle distribution patterns was established that overcame the power consumption bottleneck caused by traditional RSU's fixed coverage to minimize the total power consumption of RSU. Furthermore, the concept of candidate communication service area (CCSA) was introduced, utilized in combination with an exploratory RSU deployment algorithm (ERDA) and an enhanced genetic algorithm (eGA) to implement the RSU deployment strategy. Analysis and simulation results indicate that, compared with conventional methods, the proposed RSU deployment stra-tegy significantly reduces redundant road coverage, leading to minimized RSU power consumption. In low vehicle density, the ERDA can achieve optimal solutions with low computational complexity. In high vehicle density, the eGA provides a reasonable balance between complexity and performance. Therefore, the proposed strategy provides practical engineering guidance for urban transportation systems.

SHILAP Revista de lepidopterología
Sustainable cities and communities
Openalex Percentile: Top 31%
Particle Detector Development and Performance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.