期刊文献+

DM-PBFT:Double Layers and Multi Copies-Enabled Secure and Efficient Practical Byzantine Fault Tolerance Consensus Algorithm

在线阅读 下载PDF
导出
摘要 Practical byzantine fault tolerance(PBFT)can reduce energy consumption and achieve high throughput compared with the traditional PoW algorithm,which is more suitable for a strongly consistent consortium blockchain.However,due to the frequent communication among nodes,PBFT cannot realize scalability in large-scale networks.Existing PBFTbased algorithms still ignore performance and security.Therefore,we propose a secure and efficient practical byzantine fault tolerance based on double layers and multi copies(DM-PBFT).We design a reputation evaluation and node scheduling method for DMPBFT.And then we propose an adaptive node scheduling strategy based on the derived threshold values after analyzing the system communication complexity and security.Combining the above research,a node dynamic adjustment mechanism is proposed to freeze or adjust the node operation status according to the system environment.Simulation experiments show that the proposed mechanism can improve efficiency and increase the system’s throughput.
出处 《China Communications》 2026年第1期204-217,共14页 中国通信(英文版)
基金 supported in part by Beijing Natural Science Foundation(L244010,251038) National Natural Science Foundation of China(92467203,62372050,62502041) CCF-Huawei Populus Grove Fund(TC202418) Fellowship of China National Postdoctoral Program for Innovative Talents(BX20240045) China Postdoctoral Science Foundation General Program(2025M773481).
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部