中圖分類號(hào)：TP315.69 文獻(xiàn)標(biāo)志碼：A DOI: 10.16157/j.issn.0258-7998.223075 中文引用格式： 楊孝天,，馬冉,，李江，等. 基于組播通信的PBFT算法改進(jìn)[J]. 電子技術(shù)應(yīng)用,，2023,，49(2)：67-71. 英文引用格式： Yang Xiaotian，Ma Ran,，Li Jiang,，et al. Improvement of PBFT algorithm based on multicast communication[J]. Application of Electronic Technique，2023,，49(2)：67-71.
Improvement of PBFT algorithm based on multicast communication
Yang Xiaotian,，Ma Ran，Li Jiang,，Gao Fei
School of Information Science and Technology,， Tibet University， Lhasa 850000,，China
Abstract： PBFT algorithm has some problems such as high communication complexity and performance decrease with the increase of nodes.This paper introduces multicast communication applied to RPBFT(role-based Byzantine consensus mechanism),this paper proposes a WRPBFT consensus algorithm with low communication complexity, which can allocate consensus nodes dynamically and does not degrade with the increase of the number of nodes.WRPBF divides nodes into consensus nodes and candidate nodes, and dynamically selects consensus nodes participating in consensus for multicast communication.Experiments and analysis show that WRPBFT consensus algorithm can dynamically achieve node partitioning and selection, and WRPBFT algorithm has higher throughput, lower delay and lower communication complexity compared with traditional PBFT algorithm.
