Two-layer consensus based on master-slave consortium chain data sharing for Internet of Vehicles

TL;DR

A large number of experimental results show that the proposed WRBFT algorithm reduces delay, and improves throughput and system security.

Abstract

Due to insufficient scalability, the existing consortium chain cannot meet the requirements of low latency, high throughput, and high security when applied to Internet of Vehicles (IoV) data sharing. Therefore, we propose a two-layer consensus algorithm based on the master-slave consortium chain - Weighted Raft and Byzantine Fault Tolerance (WRBFT). The intra-group consensus of the WRBFT algorithm adopts weighted Raft, and the best node is selected as the master node to lead the intra-group consensus by comprehensively evaluating the signal-to-noise ratio (SNR), data processing capacity and storage capacity of the nodes. The inter-group consensus adopts practical Byzantine fault tolerance (PBFT) based on BLS aggregate signature with nonlinear coefficients to ensure that the inter-group consensus can tolerate 1/3 of Byzantine nodes. At the same time, the verifiable random function (VRF) is used to select the master node of the inter-group consensus to ensure the randomness of the master node. A large number of experimental results show that the proposed WRBFT algorithm reduces delay, and improves throughput and system security.

Figures (13)

• Figure 1: Data sharing model of IoV based on master-slave consortium chain.
• Figure 2: IoV blockchain data sharing process.
• Figure 3: The implementation flow chart of the WRBFT algorithm (the superscripts of primary and replica represent the layer number, the first layer represents the intra-group consensus, and the second layer represents the inter-group consensus).
• Figure 4: Consensus latency of five consensus algorithms.
• Figure 5: Throughput of five consensus algorithms.