A PBFT Consensus Scheme with Reputation Value Voting Based on Dynamic Clustering
At present, the consensus algorithm based on reputation voting generally has the problem of credit value accumulation caused by Matthew effect, which will lead to the risk of system centralization. Therefore, we propose a new blockchain consensus scheme b
- PDF / 2,009,234 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 23 Downloads / 293 Views
Jiangsu, China [email protected] 2 Purple Mountain Laboratories for Network and Communication Security, Nanjing 211111, Jiangsu, China
Abstract. At present, the consensus algorithm based on reputation voting generally has the problem of credit value accumulation caused by Matthew effect, which will lead to the risk of system centralization. Therefore, we propose a new blockchain consensus scheme based on PBFT mechanism, which divides the nodes into three categories: production node, upper node and common node, and the first two types are generated by node selection algorithm and replaced regularly. In the node selection algorithm, random parameters are introduced to make the reputation value no longer the only standard. In addition, in order to solve the problems of high message complexity and poor scalability shortcomings in PBFT, we use ISODATA algorithm to segment the nodes in the system, and simplify the consensus process of these existing PBFT algorithm, which greatly reduces the message complexity of the consensus processing without compromising the fault-tolerant performance of the system. Keywords: Blockchain · PBFT · Dynamic clustering · Reputation model
1 Introduction As the underlying core technology of Bitcoin, blockchain is essentially considered as a decentralized distributed ledger. With the core advantages of decentralization, blockchain has huge development potential in the fields of finance, IoT, healthcare, privacy data management and so on [1–3]. Consensus mechanism is an important part of blockchain technology, and its quality directly affect the performance of the system. Although public blockchain algorithms such as Pow [4], PoS [5], and DPoS [6] have good security, they still have some problems including high time-delay and low throughput capacity. Paxos [7] and Raft [8] are traditional representative distributed consensus algorithms, which are mainly oriented to databases, logs and other underlying storage areas however, the Byzantine-fault-tolerance problem was not considered in these algorithms. The PBFT algorithm [9] solves the Byzantine-fault-tolerance problem well, but the nodes cannot dynamically join the system while PBFT is running, and its scalability needs to be improved. Scalability will be one of the biggest challenges in the application © Springer Nature Singapore Pte Ltd. 2020 S. Yu et al. (Eds.): SPDE 2020, CCIS 1268, pp. 336–354, 2020. https://doi.org/10.1007/978-981-15-9129-7_24
A PBFT Consensus Scheme with Reputation Value Voting
337
of blockchain technology [10]. Although there are some problems with the PBFT algorithm, due to its advantages of low time-delay, low energy consumption, no bifurcation, and resolution of Byzantine-fault-tolerance, PBFT has a better overall performance and is more suitable for most customized application scenarios [11]. Among the related researches on the improvement of the PBFT algorithm, the research based on credit and voting has a relatively good performance in balance of the scalability, security and decentralization. However, the f
Data Loading...
