R-PBFT: A secure and intelligent consensus algorithm for Internet of vehicles

Abstract

Blockchain applications in the Internet of Vehicle (IoV) employ a secure and distributed consensus method, such as Practical Byzantine Fault Tolerance (PBFT) and Proof-of-Work (PoW), to reduce the load on the central server of IoV and the likelihood of single-node attacks. While traditional consensus algorithms based IoV improves consistency, efficiency, and eliminates single-node attacks, it has some limitations, including a delayed consensus process, restricted transaction frequency, and substantial block congestion. To address these limitations, we propose a fast and intelligent consensus mechanism called R-PBFT (Reputed PBFT). The R-PBFT improves the PBFT consensus process through the use of a reputation mechanism computed by logistic regression. We have built a testbed using the Raspberry Pi 4 and NVIDIA Jetson Nano platforms and experimented with the proposed scheme. The experiment result shows that the proposed R-PBFT outperforms state-of-the-art approaches by minimizing consensus delay by 50%, improving transaction frequency by 24% and throughput by 50%, reducing block congestion by 57%, and improves fairness by 15%. According to security analysis, R-PBFT is secure against Finney, Sybil, eclipse, routing, and impersonation attacks.