DPoSB: Delegated Proof of Stake with node's behavior and Borda Count
Chao Tan, Liang Xiong
Abstract
Blockchain was known by Satoshi Nakamoto in 2008 because of Bitcoin. After more than a decade of development, blockchain has been widely used in medical, digital finance, and electronic evidence, etc. Consensus algorithm is the core part of blockchain and has become the bottleneck of blockchain performance. At present, there are dozens of different consensus algorithms for different application context, such as Proof of Work (PoW), Proof of Stake (PoS), Delegate Proof of Stake (DPoS), Proof of Reputation (PoR), etc. But in Public blockchains, their performance, security and stability are difficult to support a large project. This paper introduces an improved consensus algorithm named Delegated Proof of Stake with node's behavior and Borda Count (DPoSB) which based on the node behavior monitoring in DPoS and Borda count voting. The node's behavior of generating blocks is used as a reference index for node elections, and it will increase the difficulty for nodes that have bad behavior. Then, combined with the Borda Count to elect nodes that is more in line with the other nodes' wishes. So, the elected nodes are more secure and fairer, thereby ensuring the stability of the system and the interests of blockchain nodes. Finally, the feasibility and correctness of the consensus algorithm is proved by simulation experiments of the blockchain system.