An Improved Delegated Proof Of Stake Consensus Algorithm

2020 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI2020)(2021)

引用 25|浏览3
暂无评分
摘要
Aiming at the problems of the existing DPoS(Delegated Proof of Stake) consensus algorithm, such as low enthusiasm of voting nodes and difficulties in dealing with malicious nodes, we improve the traditional DPoS consensus algorithm and propose a reputation-based delegated proof of stake consensus algorithm, called Reputation-DPoS. In our Reputation-DPoS, the reputation model is introduced. By evaluating the behavior of nodes, nodes are divided into different trusted states, and high-quality nodes in the network are selected as consensus nodes to reduce security risks and improve efficiency. Besides, incentive methods of reputation and token are used to improve the enthusiasm of nodes to participate in voting. Simulation results show that our Reputation-DPoS can reduce the probability of malicious nodes being selected and optimize the state of nodes in DPoS. Nodes with good behavior will get more votes and rewards, which will motivate nodes and improve the security of the system. Insert here your abstract text. (C) 2021 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the International Conference on Identification, Information and Knowledge in the internet of Things, 2020.
更多
查看译文
关键词
Blockchain, Consensus Algorithm, DPoS, Reputation Model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要