现代电子技术2026,Vol.49Issue(11):107-113,118,8.
基于人工蜂群优化和分组评分机制的改进拜占庭算法
Improved Byzantine algorithm based on artificial bee colony optimization and group scoring mechanism
摘要
Abstract
In an untrusted environment,the consortium blockchain provides a way to share energy data securely.The practical Byzantine fault tolerance(PBFT)algorithm is one of the consensus algorithms widely used in the consortium blockchain,yet it has defects such as low consensus efficiency and high communication overhead.Therefore,the PBFT algorithm is improved and named ABC-EPBFT(artificial bee colony-energy practical Byzantine fault tolerance).In the ABC-EPBFT algorithm,the set of reliable nodes is selected in advance by the ABC algorithm,so as to narrow the consensus range.The group scoring mechanism is used to update consensus nodes dynamically,and narrows the node range furthermore,so that the node reliability is improved.It can be seen in the experiments and analysis that the consensus delay of the proposed algorithm is reduced by about 98%,and its communication overhead is reduced by about 97.2%on average in comparision with those of the traditional PBFT algorithm.To sum up,the improved algorithm is of rationality.The algorithm has obvious advantages in computing cost and consensus efficiency,and can be applied to energy data trading and sharing scenarios.关键词
能源交易/实用拜占庭容错/共享联盟区块链/分组评分/人工蜂群算法/智能优化算法Key words
energy trading/PBFT/shared consortium blockchain/group scoring/ABC algorithm/intelligent optimization algorithm分类
信息技术与安全科学引用本文复制引用
刘湘楠,于万钧,薛庆水..基于人工蜂群优化和分组评分机制的改进拜占庭算法[J].现代电子技术,2026,49(11):107-113,118,8.基金项目
国家自然科学基金项目(61672350) (61672350)
国家自然科学基金项目(61170227) (61170227)
教育部基金(39120K178038,14YJA880033) (39120K178038,14YJA880033)
国家社会科学基金资助项目(16BGL003) (16BGL003)