Sharing Semantic Information Among Vehicles to Reduce Computation and Communication Energy Consumption

In this paper, we propose a framework for semantic information sharing between vehicles to reduce energy consumed by computation related to processing of sensor data. The energy consumption is reduced via avoiding redundant semantics extraction by multiple vehicles. We develop an algorithm that allows sharing semantic information derived by one vehicle with neighboring vehicles, thereby reducing the need for individual semantics extraction. Of course, semantic sharing introduces communication energy overhead. Thus, in our work, we consider not only computation but also communication energy. We propose graph representation of the problem to allow mapping of a part of the energy consumption minimization to the maximum independent set problem, which we further combine with a greedy and recursive approach. Simulations demonstrate that the proposed algorithm can save up to 61% of energy compared to state-of-the-art approaches.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174581
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sharing Semantic Information Among Vehicles to Reduce Computation and Communication Energy Consumption

Zdeněk Bečvář, Mostafa Kishani
Vehicular Ad Hoc Networks (VANETs)
article

Sharing Semantic Information Among Vehicles to Reduce Computation and Communication Energy Consumption

Zdeněk Bečvář, Mostafa Kishani
article en

Abstract

In this paper, we propose a framework for semantic information sharing between vehicles to reduce energy consumed by computation related to processing of sensor data. The energy consumption is reduced via avoiding redundant semantics extraction by multiple vehicles. We develop an algorithm that allows sharing semantic information derived by one vehicle with neighboring vehicles, thereby reducing the need for individual semantics extraction. Of course, semantic sharing introduces communication energy overhead. Thus, in our work, we consider not only computation but also communication energy. We propose graph representation of the problem to allow mapping of a part of the energy consumption minimization to the maximum independent set problem, which we further combine with a greedy and recursive approach. Simulations demonstrate that the proposed algorithm can save up to 61% of energy compared to state-of-the-art approaches.

Czech Technical University in Prague (CZ)
Openalex Percentile: Top 73%
Vehicular Ad Hoc Networks (VANETs)
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.