基于人工蜂群优化和分组评分机制的改进拜占庭算法OA

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.