H-PBFT: A Hierarchical and Credit-Aware PBFT Consensus Mechanism for Blockchain-Based Intelligent Transportation Systems
Future Internet · 30.07.2026 · 18 (8) · 405
DOI: 10.3390/fi18080405 ↗Kurz gefasst
Fachartikel in der Zeitschrift Future Internet, online erschienen am 30.07.2026. Verfasst von Zhenhua Wang und 7 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: the Fundamental Research Funds for the Central Universities Special Fund Project, the Youth Fund Project of Ministry of Education in China Humanities and Social Sciences Foundation, the General Research Projects in Philosophy and Social Sciences of Colleges and Universities in Jiangsu Province.
Abstract (Originalsprache)
To address the risks of centralized single-point failures and data privacy leaks associated with massive data storage in Intelligent Transportation Systems (ITS) and Vehicle-to-Everything (V2X) environments, this paper proposes a distributed secure storage architecture based on blockchain. However, traditional Practical Byzantine Fault-Tolerant (PBFT) algorithms suffer from scalability bottlenecks in large-scale dynamic networks, such as high communication overhead and low consensus efficiency. Therefore, this paper designs a hierarchical and reputation-aware improved consensus mechanism (H-PBFT). First, this mechanism introduces a geographical location grouping strategy, dividing all network nodes into several local consensus groups and leveraging edge computing characteristics to achieve rapid consensus within each group. Second, a multi-dimensional reputation evaluation model (comprehensively considering historical behavior, performance, and availability) is constructed to dynamically elect representative nodes from each group to participate in global consensus, thereby significantly reducing the communication complexity from O(N2). Simulation results show that compared with standard PBFT, Q-PBFT, and APBFT, H-PBFT exhibits significant advantages in consensus latency, throughput, and view switching recovery time, and maintains high system robustness even in complex network environments with malicious nodes.
Förderung
- the Fundamental Research Funds for the Central Universities Special Fund Project
- the Youth Fund Project of Ministry of Education in China Humanities and Social Sciences Foundation
- the General Research Projects in Philosophy and Social Sciences of Colleges and Universities in Jiangsu Province
- the Research Project on Higher Education Teaching Reform of Jiangsu Association of Automation
- the General Project on Teaching Reform of Nanjing Police University
- the Harbin Xinguang Optic-electronics Technology Co., Ltd. Horizontal Research Project
Zitieren
APA
Wang, Z., Hu, J., Wang, X., Wang, Z., Yan, H., Wu, Z., Liu, M., & Tian, Z. (2026). H-PBFT: A Hierarchical and Credit-Aware PBFT Consensus Mechanism for Blockchain-Based Intelligent Transportation Systems. Future Internet, 18(8), 405. https://doi.org/10.3390/fi18080405
Vancouver
Wang Z, Hu J, Wang X, Wang Z, Yan H, Wu Z, et al. H-PBFT: A Hierarchical and Credit-Aware PBFT Consensus Mechanism for Blockchain-Based Intelligent Transportation Systems. Future Internet. 2026;18(8):405. doi:10.3390/fi18080405
BibTeX
@article{Wang2026,
author = {Wang, Zhenhua and Hu, Jiangang and Wang, Xinmeng and Wang, Zixuan and Yan, Haokun and Wu, Zheng and Liu, Mingxuan and Tian, Zhen},
title = {H-PBFT: A Hierarchical and Credit-Aware PBFT Consensus Mechanism for Blockchain-Based Intelligent Transportation Systems},
journal = {Future Internet},
year = {2026},
volume = {18},
number = {8},
pages = {405},
doi = {10.3390/fi18080405}
}
EUVIMED