作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2023, Vol. 49 ›› Issue (3): 58-66,79. doi: 10.19678/j.issn.1000-3428.0064338

• 热点与综述 • 上一篇    下一篇

面向工业互联网的区块链分层分片研究

白首圳, 陈美娟   

  1. 南京邮电大学 通信与信息工程学院, 南京 210003
  • 收稿日期:2022-03-30 修回日期:2022-05-31 发布日期:2022-08-09
  • 作者简介:白首圳(1997—),男,硕士研究生,主研方向为区块链技术;陈美娟,副教授、博士。
  • 基金资助:
    国家自然科学基金“基于区块链和机器学习的移动边缘云网络可信协作机制和资源优化方法”(61871237);江苏省科技计划重点项目“新型边缘网络协同控制设备关键技术研发”(BE2020084-3);江苏省重点研发计划“基于区块链的卫星与无线通信融合网络可信数据交换与共享关键技术研究与验证”(BE2019017)。

Research on Layering and Sharding of Blockchain for Industrial Internet

BAI Shouzhen, CHEN Meijuan   

  1. College of Communication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • Received:2022-03-30 Revised:2022-05-31 Published:2022-08-09

摘要: 区块链的不可篡改、去中心化等特点能够有效解决工业互联网中日益突出的安全和隐私问题,然而当前主流区块链平台的吞吐量远不能满足工业互联网海量数据快速上链的需求,并且传统区块链采用的高冗余存储机制也无法适用于工业互联网场景。建立分层分片区块链架构,将区块数据分层存储在多个分布式云服务器和边缘服务器中,以应对工业互联网不断增长的数据量。依据边缘服务器之间的拓扑结构,设计一种基于复杂网络社团划分算法的改进区块链网络分片算法,在提升区块链网络吞吐量的同时缩短分片时间。将区块广播过程形式化为生成树论证了区块广播时间对吞吐量的影响,在此基础上提出一种基于生成树的片内主节点选取算法,进一步提升区块链网络的吞吐量。实验结果表明,与经典复杂网络社团划分算法相比,改进的区块链网络分片算法在对大规模网络进行分片时能够在不牺牲分片质量的前提下缩短约36%的分片时间,同时减少了各分片内区块的广播时间。

关键词: 工业互联网, 区块链, 分片, 社团划分, 生成树

Abstract: The blockchain technology can effectively solve the increasingly prominent security and privacy issues in the industrial Internet because its non-tampered and decentralized characteristics.However, the throughput of the current mainstream blockchain platform is far from satisfying the requirement for rapid on-chaining of massive data in industrial Internet, and the high redundancy storage mechanism adopted by the traditional blockchain can not be applied to industrial scenarios.A layering and sharding blockchain architecture is established.The block data is layered and stored in multiple distributed cloud servers and edge servers to cope with the increasing amount of data in the industrial Internet. Based on the topology between the edge servers, an improved blockchain network sharding algorithm based on complex network community division algorithm is designed to improve the throughput of the blockchain network and shorten the sharding time.The block broadcast process is formalized as a spanning tree, and the influence of block broadcast time on throughput is demonstrated. Based on this, a leader-node selection algorithm in the shard based on spanning tree is proposed to further improve the throughput of the blockchain network.The experimental results show that compared with the classical complex network community division algorithm, the improved blockchain network sharding algorithm can shorten the sharding time by approximately 36% without sacrificing the sharding quality and simultaneously reduce the broadcast time of blocks in each shard.

Key words: industrial Internet, blockchain, sharding, community division, spanning tree

中图分类号: