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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Khan, F.A., Asif, M., Ahmad, A., et al.: Blockchain technology, improvement suggestions, security challenges on smart grid and its application in healthcare for sustainable development. Sustain. Cities Soc. 55, 102018 (2020)
Casino, F., Dasaklis, T., Patsakis, C.: A systematic literature review of blockchain-based applications: current status, classification and open issues. Telemat. Inf. 36, 55–81 (2019)
Frizzo-Barker, J., Chow-White, P.A., Adams, P.R., et al.: Blockchain as a disruptive technology for business: a systematic review. Int.J. Inf. Manag. 51 (2020)
Xue, T., Yuan, Y., Ahmed, Z., et al.: Proof of contribution: a modification of proof of work to increase mining efficiency. In: 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC), pp. 636–644 (2018)
King, S., Nadal, S.: PPcoin: peer-to-peer crypto-currency with proof-of-stake. Engineering (2012)
Nguyen, C.T., Hoang, D.T., Nguyen, D.N., et al.: Proof-of-stake consensus mechanisms for future blockchain networks: fundamentals, applications and opportunities. IEEE Access 7, 85727–85745 (2019)
Lamport, L.: Brief announcement: leaderless byzantine paxos. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 141–142. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24100-0_10
Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: USENIX, pp. 305–320 (2014)
Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 173–186 (1999)
Bugday, A., Ozsoy, A., Öztaner, S.M., et al.: Creating consensus group using online learning-based reputation in blockchain networks. Pervasive Mob. Comput. 59 (2019)
Vincent, G.: From blockchain consensus back to Byzantine consensus. Future Gener. Comput. Syst. 107, 760–769 (2020)
Wang, Y., et al.: Study of blockchains’s consensus mechanism based on credit. IEEE Access 7, 10224–10231 (2019)
Wang, Y., Song, Z., Cheng, T.: Improvement research of PBFT consensus algorithm based on credit. In: Zheng, Z., Dai, H.-N., Tang, M., Chen, X. (eds.) BlockSys 2019. CCIS, vol. 1156, pp. 47–59. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-2777-7_4
Lv, S., Li, H., Wang, H., Wang, X.: CoT: a secure consensus of trust with delegation mechanism in blockchains. In: Si, X., Jin, H., Sun, Y., Zhu, J., Zhu, L., Song, X., Lu, Z. (eds.) CBCC 2019. CCIS, vol. 1176, pp. 104–120. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-3278-8_7
Veronese, G.S., Correia, M., Bessani, A.N., et al.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16–30 (2013)
Wang, H., Guo, K., Pan, Q.: Byzantine fault tolerance consensus algorithm based on voting mechanism. J. Comput. Appl. 39(06), 1766–1771 (2019)
Wang, H., Guo, K.: Byzantine fault tolerant algorithm based on vote. In: 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Guilin, China, pp. 190–196 (2019)
Li, K., Li, H., Wang, H., et al.: PoV: an efficient voting-based consensus algorithm for consortium blockchains. Front. Blockchain 3, 11 (2020)
Ball, G.H., Hall, D.J.A.: Clustering technique for summarizing multivariate data. Syst. Res. Behave Sci. 12(2), 153–155 (1967)
Likas, A., Vlassis, M., Verbeek, J.: The global K-means clusteringalgorithm. Pattern Recogn. 36(2), 451–461 (2003)
Pattabiraman, V., Parvathi, R., Nedunchezian, R., et al.: A novel spatial clustering with obstacles and facilitators constraint based on edge detection and K-medoids. In: International Conference on Computer Technology and Development, pp. 402–406 (2009)
Tang, C., Wu, L., Wen, G., et al.: Incentivizing honest mining in blockchain networks: a reputation approach. IEEE Trans. Circ. Syst. II: Express Brief. 67(1), 117–121 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhu, S., Zhang, Z., Chen, L., Chen, H., Wang, Y. (2020). A PBFT Consensus Scheme with Reputation Value Voting Based on Dynamic Clustering. In: Yu, S., Mueller, P., Qian, J. (eds) Security and Privacy in Digital Economy. SPDE 2020. Communications in Computer and Information Science, vol 1268. Springer, Singapore. https://doi.org/10.1007/978-981-15-9129-7_24
Download citation
DOI: https://doi.org/10.1007/978-981-15-9129-7_24
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-9128-0
Online ISBN: 978-981-15-9129-7
eBook Packages: Computer ScienceComputer Science (R0)