摘要： PBFT算法存在通信复杂度高、性能受节点增加而下降等问题，引入组播通信应用于RPBFT（基于角色的拜占庭共识机制），提出了一种通信复杂度低、可以动态分配共识节点、不因节点数增加而性能下降的WRPBFT共识算法。WRPBFT将节点划分为共识节点和候选节点两类节点，动态地选取参与共识的共识节点进行组播通信。实验与分析表明，WRPBFT共识算法可以动态地实现节点的划分与选取，并且相较传统PBFT算法，WRPBFT算法具备更高吞吐量、更低的时延和更低的通信复杂度。

中图分类号：TP315.69
文献标志码：A
DOI: 10.16157/j.issn.0258-7998.223075
中文引用格式： 杨孝天，马冉，李江，等. 基于组播通信的PBFT算法改进[J]. 电子技术应用，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

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.

Key words : PBFT；multicast；P2P；blockchain