ULS-PBFT: An ultra-low storage overhead PBFT consensus for blockchain

被引:18
作者
Luo, Haoxiang [1 ]
机构
[1] Univ Elect Sci & Technol China, Minist Educ, Key Lab Opt Fiber Sensing & Commun, Chengdu, Peoples R China
来源
BLOCKCHAIN-RESEARCH AND APPLICATIONS | 2023年 / 4卷 / 04期
关键词
Blockchain; Consensus mechanism; PBFT; Storage overhead; Hierarchical grouping; BYZANTINE FAULT-TOLERANCE;
D O I
10.1016/j.bcra.2023.100155
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Since the Practical Byzantine Fault Tolerance (PBFT) consensus mechanism can avoid the performance bottleneck of blockchain systems caused by Proof of Work (PoW), it has been widely used in many scenarios. However, in the blockchain system, each node is required to back up all transactions and block data of the system, which will waste a lot of storage resources. It is difficult to apply to scenarios with limited storage resources such as unmanned aerial vehicle networks and smart security protection; thus, it is often used in small-scale networks. In order to deploy PBFT-based blockchain systems in large-scale network scenarios, we propose an ultra-low storage overhead PBFT consensus (ULS-PBFT), which groups nodes hierarchically to limit the storage overhead within the group. In this paper, we first propose an optimal double-layer PBFT consensus from the perspective of minimizing the storage overhead, and prove that this consensus can significantly reduce the storage overhead. In addition, we also investigate the superiority of ULS-PBFT in terms of communication overhead while setting the security threshold in the presence of the possibility of Byzantine nodes. The simulation results demonstrate the advantages of ULS-PBFT. Then, we extend such grouping idea to the blockchain system with X-layer PBFT and analyze its storage and communication overhead. Finally, the node grouping strategy of double-layer PBFT is studied for four application scenarios when the performance of storage overhead, communication overhead, and security are considered comprehensively.
引用
收藏
页数:13
相关论文
共 40 条
[1]  
Bach LM, 2018, 2018 41ST INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), P1545, DOI 10.23919/MIPRO.2018.8400278
[2]  
Bendiksen C., 2018, CoinShares Research, V21, P3
[3]   AWARE: Adaptive Wide-Area Replication for Fast and Resilient Byzantine Consensus [J].
Berger, Christian ;
Reiser, Hans P. ;
Sousa, Joao ;
Bessani, Alysson .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (03) :1605-1620
[4]   When Internet of Things Meets Blockchain: Challenges in Distributed Consensus [J].
Cao, Bin ;
Li, Yixin ;
Zhang, Lei ;
Zhang, Long ;
Mumtaz, Shahid ;
Zhou, Zhenyu ;
Peng, Mugen .
IEEE NETWORK, 2019, 33 (06) :133-139
[5]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[6]   CyberChain: Cybertwin Empowered Blockchain for Lightweight and Privacy-Preserving Authentication in Internet of Vehicles [J].
Chai, Haoye ;
Leng, Supeng ;
He, Jianhua ;
Zhang, Ke ;
Cheng, Baoyi .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (05) :4620-4631
[7]   A blockchain consensus mechanism that uses Proof of Solution to optimize energy dispatch and trading [J].
Chen, Sijie ;
Mi, Hanning ;
Ping, Jian ;
Yan, Zheng ;
Shen, Zeyu ;
Liu, Xuezhi ;
Zhang, Ning ;
Xia, Qing ;
Kang, Chongqing .
NATURE ENERGY, 2022, 7 (06) :495-+
[8]   CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY [J].
DWORK, C ;
LYNCH, N ;
STOCKMEYER, L .
JOURNAL OF THE ACM, 1988, 35 (02) :288-323
[9]   DLBN: Group Storage Mechanism Based on Double-Layer Blockchain Network [J].
Fan, Yanqing ;
Qiu, Tie ;
Zhang, Lidi ;
Xu, Tianyi ;
Liu, Wenyuan ;
Zhou, Xiaobo ;
Wan, Zhiguo .
IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (20) :19649-19659
[10]  
Gao S, 2019, CHINA COMMUN, V16, P111, DOI 10.23919/JCC.2019.12.008