Research on privacy protection mechanism based on edge computing in Internet of Vehicles

Aiming at the contradiction between real-time data processing and privacy protection in edge computing of Internet of Vehicles, this paper proposes a dynamic collaborative differential privacy mechanism (DCDP). This mechanism clusters edge nodes by DBSCAN algorithm, builds a density-aware dynamic privacy budget allocation model, and realizes multi-node collaborative data aggregation by combining the improved PBFT consensus protocol. The experiment is based on the SUMO-NS-3 joint simulation platform. In the scenario of 300 m coverage radius, when the vehicle density reaches 80 vehicles $/ \mathrm{km}^{2}$, the privacy leakage rate of DCDP is only $0.078 \%$, which is $42.3 \%$ lower than that of traditional differential privacy (TDP); the root mean square error (RMSE) of traffic flow estimation is 2.15 vehicles/minute, which is $28.7 \%$ higher than that of the location-independent algorithm (PIDP). The system delay experiment shows that the average processing time of DCDP is 12.4 ms, which is $65.2 \%$ shorter than that of the blockchain-assisted solution (BCDP).

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/iscait64916.2025.11010286
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on privacy protection mechanism based on edge computing in Internet of Vehicles

Jinrui Wang
E-commerce and Technology Innovations
article

Research on privacy protection mechanism based on edge computing in Internet of Vehicles

Jinrui Wang
article en

Abstract

Aiming at the contradiction between real-time data processing and privacy protection in edge computing of Internet of Vehicles, this paper proposes a dynamic collaborative differential privacy mechanism (DCDP). This mechanism clusters edge nodes by DBSCAN algorithm, builds a density-aware dynamic privacy budget allocation model, and realizes multi-node collaborative data aggregation by combining the improved PBFT consensus protocol. The experiment is based on the SUMO-NS-3 joint simulation platform. In the scenario of 300 m coverage radius, when the vehicle density reaches 80 vehicles $/ \mathrm{km}^{2}$, the privacy leakage rate of DCDP is only $0.078 \%$, which is $42.3 \%$ lower than that of traditional differential privacy (TDP); the root mean square error (RMSE) of traffic flow estimation is 2.15 vehicles/minute, which is $28.7 \%$ higher than that of the location-independent algorithm (PIDP). The system delay experiment shows that the average processing time of DCDP is 12.4 ms, which is $65.2 \%$ shorter than that of the blockchain-assisted solution (BCDP).

Jiangsu University of Science and Technology (CN)
Openalex Percentile: Top 77%
E-commerce and Technology Innovations
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.