TY - JOUR
T1 - Two-Layer Consensus Based on Primary-Secondary Consortium Chain Data Sharing for Internet of Vehicles
AU - Zhao, Feng
AU - Yang, Benchang
AU - Li, Chunhai
AU - Zhang, Chuan
AU - Zhu, Liehuang
AU - Liang, Guoling
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2024
Y1 - 2024
N2 - 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 primary-secondary 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 primary 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 primary node of the inter-group consensus to ensure the randomness of the primary node. A large number of experimental results show that the proposed WRBFT algorithm reduces delay, and improves throughput and system security.
AB - 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 primary-secondary 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 primary 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 primary node of the inter-group consensus to ensure the randomness of the primary node. A large number of experimental results show that the proposed WRBFT algorithm reduces delay, and improves throughput and system security.
KW - BLS aggregate signature
KW - Consortium chain
KW - signal-to-noise ratio (SNR)
KW - verifiable random function (VRF)
UR - http://www.scopus.com/inward/record.url?scp=85193032146&partnerID=8YFLogxK
U2 - 10.1109/TVT.2024.3397818
DO - 10.1109/TVT.2024.3397818
M3 - Article
AN - SCOPUS:85193032146
SN - 0018-9545
VL - 73
SP - 13828
EP - 13838
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 9
ER -