SLDSM: sparse location data sharing model based on VN-PBFT for IoV
Location data sharing is a key foundational service for intelligent transportation. However, in sparse location data scenarios, existing data sharing solutions based on Practical Byzantine Fault Tolerance (PBFT) consensus face high latency and even consensus failure issues. In response to this issue, we propose a sparse location data sharing model based on virtual node PBFT consensus, which utilizes virtual nodes to complete node clustering and improves the real-time performance of the model. Simulation experiment results show that compared with PBFT and its improved algorithm Optimized Byzantine Consensus Parallelism Scheme (ParBFT), the average consensus latency of Virtual Nodes-Practical Byzantine Fault Tolerance (VN-PBFT) algorithm is increased by 42.91% and 23.48% respectively.
Authors
- Jun Wang (ORCID: https://orcid.org/0000-0001-7056-0503)
- Yi Xin Zhou (ORCID: https://orcid.org/0000-0002-1460-322X)
- Dejun Wang (ORCID: https://orcid.org/0000-0002-8944-9482)
- Qiang Yan (ORCID: https://orcid.org/0009-0008-7950-301X)
Institutions
- Minzu University of China (CN)
- Institute of Computing Technology (CN)
Publication Details
- Published
- 2025-05-19
- DOI
- https://doi.org/10.1117/12.3056950
- Primary Topic
- Opportunistic and Delay-Tolerant Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00