Data storage and sharing for the internet of vehicles and GPBFT consensus algorithm

This study constructs a secure and efficient data storage and sharing architecture for the Internet of Vehicles. A practical Byzantine fault-tolerant consensus algorithm using reputation was proposed to address the shortcomings of roadside unit equipment in the architecture. The experimental results showed that in the performance verification of reinforced data storage, the storage proportion of the research scheme was always lower than that of the comparison algorithm. In the simulated 5000 transactions, it was always lower than 40 MB, while the comparison algorithm reached a maximum of 72 MB. The efficiency of querying registration information and vehicle data increased by 38.2% and 49.1%, respectively. In the shared performance verification, the fully loaded roadside unit devices decreased by a maximum of 2.8%. Under heavy load conditions, the fully loaded nodes decreased by a maximum of 20.7%. In the validation of the proposed consensus algorithm, its performance was more stable in terms of throughput, and the number of transactions processed per second by d (10) remained basically between 380 and 640. Overall, the constructed secure and efficient data storage and sharing architecture for the Internet of Vehicles is efficient and secure, which can be effectively applied in practical IoV systems.