北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (6): 140-146.doi: 10.13190/j.jbupt.2020-206

• 研究报告 • 上一篇    

无线网络中区块链共识算法的开销分析

曹傧1,2, 聂凯君1,2, 彭木根1,2, 周治中3, 张磊4   

  1. 1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876;
    2. 北京邮电大学 信息与通信工程学院, 北京 100876;
    3. 中电科网络空间安全研究院有限公司, 成都 610041;
    4. 格拉斯哥大学 工程学院, 格拉斯哥 G12 8QQ
  • 收稿日期:2020-10-10 出版日期:2020-12-28 发布日期:2020-11-30
  • 作者简介:曹傧(1983-),男,副教授,博士生导师,E-mail:caobin@bupt.edu.cn.
  • 基金资助:
    国家自然科学基金项目(61701059);中央高校基本科研业务费专项项目;四川省国际科技创新合作/港澳台科技创新合作项目(2019YFH0163);四川省科技厅重要研究开发项目(2018JZ0071)

Overhead Analysis of Blockchain Consensus Algorithm in Wireless Networks

CAO Bin1,2, NIE Kai-jun1,2, PENG Mu-gen1,2, ZHOU Zhi-zhong3, ZHANG Lei4   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    3. China Electrics Technology Cyber Security Company Limited, Chengdu 610041, China;
    4. School of Engineering, University of Glasgow, Glasgow G12 8QQ, The United Kingdom
  • Received:2020-10-10 Online:2020-12-28 Published:2020-11-30

摘要: 选取工作量证明(PoW)和实用拜占庭容错(PBFT)作为公/私链代表,对比分析了两者在无线网络中的系统资源消耗,为区块链类型的选择提供合理评估.首先,建立公平统一的网络模型和区块链标准流程;然后,考虑无线网络传输失败导致的区块丢失,推导分析了相应的PoW分叉和PBFT视图更换概率;最后,分析了无线网络规模对PoW和PBFT的通信开销和算力开销的影响.仿真结果表明,PBFT的算力开销远小于PoW,但PBFT的通信开销受节点规模的影响较大,可扩展性较差;PoW的通信开销受节点规模的影响相对平缓,可扩展性相对较好.

关键词: 区块链, 共识算法, 系统开销, 工作量证明, 实用拜占庭容错

Abstract: In order to provide a reasonable evaluation for the choice of blockchain type, proof of work (PoW) and practical Byzantine fault tolerance (PBFT) are treated as the benchmark of typical public and private chains for blockchain selection evaluation, and the overhead of blockchain in wireless networks is studied. Firstly, a fair network system and standard blockchain procedure have been provided, and then, considering the impact of block loss generated by transmission failure, the forking probability in PoW and view change probability in PBFT have been analyzed. Moreover, how network scale affects the communication and computation overhead in PoW and PBFT has been also investigated. Finally, the experimental results show that the computational overhead of PBFT is much smaller than that of PoW, the communication overhead of PBFT is greatly affected by the scale of the node, and thus the scalability of PBFT is poor. In contrast, the overhead of PoW communication is affected by the network scale linearly, and the scalability is much better compared with PBFT.

Key words: blockchain, consensus algorithm, system overhead, proof of work, practical Byzantine fault tolerance

中图分类号: