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.

翻译：由于现有联盟链在可扩展性方面的不足，其在应用于车联网数据共享时难以满足低延迟、高吞吐量和高安全性的要求。为此，我们提出一种基于主从联盟链的双层共识算法——加权Raft与拜占庭容错算法。WRBFT算法的组内共识采用加权Raft机制，通过综合评估节点的信噪比、数据处理能力与存储能力，选取最优节点作为主节点来主导组内共识。组间共识采用基于非线性系数BLS聚合签名的实用拜占庭容错算法，确保组间共识能够容忍1/3的拜占庭节点。同时，利用可验证随机函数选取组间共识的主节点，以保证主节点的随机性。大量实验结果表明，所提出的WRBFT算法能够有效降低延迟，并提升吞吐量与系统安全性。