{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T19:23:27Z","timestamp":1792783407491,"version":"4.5.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"The Hebei Province Natural Science Fund Program"},{"name":"The Fundamental Research Funds for the Central Universities"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"DOI":"10.1007\/s12083-026-02203-z","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:38:07Z","timestamp":1774334287000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Practical Byzantine fault tolerance consensus algorithm based on dynamic reputation evaluation and master node tenure"],"prefix":"10.1007","volume":"19","author":[{"given":"Jinlei","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huajin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,24]]},"reference":[{"issue":"03","key":"2203_CR1","first-page":"66","volume":"58","author":"SY Liu","year":"2022","unstructured":"Liu SY, Lei MYX, Wang L et al (2022) Survey of blockchain key technologies and existing problems [J]. Comput Eng Appl 58(03):66\u201382","journal-title":"Comput Eng Appl"},{"key":"2203_CR2","unstructured":"Nakamoto, S (2008) Bitcoin: A peer-to-peer electronic cash system. Bitcoin.org. Retrieved from https:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"1","key":"2203_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/COMST.2022.3204702","volume":"25","author":"B Cao","year":"2023","unstructured":"Cao B, Wang Z, Zhang L et al (2023) Blockchain systems, technologies, and applications: a methodology perspective [J]. IEEE Commun Surv Tutor 25(1):353\u2013385","journal-title":"IEEE Commun Surv Tutor"},{"issue":"3","key":"2203_CR4","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1007\/s12083-024-01658-2","volume":"17","author":"S Li","year":"2024","unstructured":"Li S, Zhang H, Chen Z et al (2024) Enterprise composite blockchain double layer consensus algorithm based on improved DPoS and BFT [J]. Peer-to-Peer Network Appl 17(3):1682\u20131701","journal-title":"Peer-to-Peer Network Appl"},{"issue":"6","key":"2203_CR5","doi-asserted-by":"publisher","first-page":"2915","DOI":"10.1007\/s12083-023-01566-x","volume":"16","author":"Z-F Wang","year":"2023","unstructured":"Wang Z-F, Liu S-Q, Wang P et al (2023) BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning [J]. Peer-to-Peer Network Appl 16(6):2915\u20132928","journal-title":"Peer-to-Peer Network Appl"},{"issue":"3","key":"2203_CR6","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1093\/rfs\/hhaa075","volume":"34","author":"F Saleh","year":"2020","unstructured":"Saleh F (2020) Blockchain without waste: proof-of-stake [J]. Rev Financ Stud 34(3):1156\u20131190","journal-title":"Rev Financ Stud"},{"issue":"5","key":"2203_CR7","first-page":"10","volume":"28","author":"L Wang","year":"2021","unstructured":"Wang L, Zhu QH, Li BZ (2021) Extensive game analysis and improvement strategy of DPOS consensus mechanism [J]. J China Univ Posts Telecommun 28(5):10","journal-title":"J China Univ Posts Telecommun"},{"key":"2203_CR8","doi-asserted-by":"crossref","unstructured":"Miguel, Castro, Barbara et al (2002) Practical byzantine fault tolerance and proactive recovery [J]. ACM Trans Comput Syst 20(4):398\u2013461","DOI":"10.1145\/571637.571640"},{"key":"2203_CR9","first-page":"175","volume":"10","author":"HY Chen","year":"2024","unstructured":"Chen HY, Chen J (2024) Overview of blockchain consensus algorithms [J]. China Manage Informationization 10:175\u2013177","journal-title":"China Manage Informationization"},{"issue":"05","key":"2203_CR10","first-page":"969","volume":"41","author":"QF Shao","year":"2018","unstructured":"Shao QF, Jin CQ, Zhang Z et al (2018) Blockchain: architecture and research progress [J]. Chinese J Comput 41(05):969\u2013988","journal-title":"Chinese J Comput"},{"issue":"5","key":"2203_CR11","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TPDS.2020.3042392","volume":"32","author":"W Li","year":"2021","unstructured":"Li W, Feng C, Zhang L et al (2021) A scalable multi-layer PBFT consensus for blockchain [J]. IEEE Trans Parallel Distrib Syst 32(5):1146\u20131160","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2203_CR12","doi-asserted-by":"publisher","first-page":"76114","DOI":"10.1109\/ACCESS.2022.3192426","volume":"10","author":"Y Na","year":"2022","unstructured":"Na Y, Wen Z, Fang J et al (2022) A derivative PBFT blockchain consensus algorithm with dual primary nodes based on separation of powers-DPNPBFT [J]. IEEE Access 10:76114\u201376124","journal-title":"IEEE Access"},{"issue":"2","key":"2203_CR13","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1109\/TITS.2024.3495991","volume":"26","author":"S Dong","year":"2025","unstructured":"Dong S, Su H, Hou R et al (2025) Improved PBFT consensus mechanism based on voting sort clustering partition with group signature for IoT [J]. IEEE Trans Intell Transp Syst 26(2):2239\u20132251","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2203_CR14","doi-asserted-by":"publisher","first-page":"30274","DOI":"10.1109\/ACCESS.2022.3153701","volume":"10","author":"J Yang","year":"2022","unstructured":"Yang J, Jia Z, Su R et al (2022) Improved fault-tolerant consensus based on the PBFT algorithm [J]. IEEE Access 10:30274\u201330283","journal-title":"IEEE Access"},{"key":"2203_CR15","doi-asserted-by":"publisher","first-page":"148961","DOI":"10.1109\/ACCESS.2024.3474174","volume":"12","author":"M Kimiaei","year":"2024","unstructured":"Kimiaei M, Saidi H, Manshaei MH (2024) An adaptive and hierarchical approach to configure sharding committees in blockchains [J]. IEEE Access 12:148961\u2013148978","journal-title":"IEEE Access"},{"key":"2203_CR16","doi-asserted-by":"publisher","first-page":"6546","DOI":"10.1109\/OJCOMS.2024.3477930","volume":"5","author":"Z Zhou","year":"2024","unstructured":"Zhou Z, Onireti O, Lin X et al (2024) Implementing practical Byzantine fault tolerance over cellular networks [J]. IEEE Open J Commun Soc 5:6546\u20136560","journal-title":"IEEE Open J Commun Soc"},{"key":"2203_CR17","doi-asserted-by":"publisher","first-page":"33509","DOI":"10.1109\/ACCESS.2023.3264011","volume":"11","author":"W Jiang","year":"2023","unstructured":"Jiang W, Wu X, Song M et al (2023) A scalable Byzantine fault tolerance algorithm based on a tree topology network [J]. IEEE Access 11:33509\u201333519","journal-title":"IEEE Access"},{"key":"2203_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2022.01.029","volume":"164","author":"G Xu","year":"2022","unstructured":"Xu G, Bai H, Xing J et al (2022) SG-PBFT: a secure and highly efficient distributed blockchain PBFT consensus algorithm for intelligent Internet of vehicles [J]. J Parallel Distrib Comput 164:1\u201311","journal-title":"J Parallel Distrib Comput"},{"issue":"12","key":"2203_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","volume":"16","author":"S Gao","year":"2019","unstructured":"Gao S, Yu T, Zhu J et al (2019) T-PBFT: an EigenTrust-based practical Byzantine fault tolerance consensus algorithm [J]. China Commun 16(12):111\u2013123","journal-title":"China Commun"},{"key":"2203_CR20","doi-asserted-by":"publisher","first-page":"87803","DOI":"10.1109\/ACCESS.2022.3186682","volume":"10","author":"Z Pang","year":"2022","unstructured":"Pang Z, Yao Y, Li Q et al (2022) Electronic health records sharing model based on blockchain with checkable state PBFT consensus algorithm [J]. IEEE Access 10:87803\u201387815","journal-title":"IEEE Access"},{"key":"2203_CR21","doi-asserted-by":"publisher","first-page":"121753","DOI":"10.1109\/ACCESS.2023.3328539","volume":"11","author":"Y Sun","year":"2023","unstructured":"Sun Y, Fan Y (2023) Improved PBFT algorithm based on K-Means clustering for emergency scenario swarm robotic systems [J]. IEEE Access 11:121753\u2013121765","journal-title":"IEEE Access"},{"key":"2203_CR22","doi-asserted-by":"publisher","first-page":"186605","DOI":"10.1109\/ACCESS.2024.3425841","volume":"12","author":"P Qiao","year":"2024","unstructured":"Qiao P (2024) Enhancing manufacturing-as-a-service supply chain transparency with master-slave multi-chain and SQS-PBFT [J]. IEEE Access 12:186605\u2013186616","journal-title":"IEEE Access"},{"issue":"13","key":"2203_CR23","doi-asserted-by":"publisher","first-page":"11440","DOI":"10.1109\/JIOT.2023.3243189","volume":"10","author":"H Qushtom","year":"2023","unstructured":"Qushtom H, Mi\u0161i\u0107 J, Mi\u0161i\u0107 VB et al (2023) A two-stage PBFT architecture with trust and reward incentive mechanism [J]. IEEE Internet Things J 10(13):11440\u201311452","journal-title":"IEEE Internet Things J"},{"key":"2203_CR24","doi-asserted-by":"publisher","first-page":"73414","DOI":"10.1109\/ACCESS.2023.3295696","volume":"11","author":"J Xu","year":"2023","unstructured":"Xu J, Hua C, Zhang Y (2023) A blockchain-based framework for supervision of livelihood issues: proof of concept with optimized consensus [J]. IEEE Access 11:73414\u201373434","journal-title":"IEEE Access"},{"key":"2203_CR25","doi-asserted-by":"publisher","first-page":"10393","DOI":"10.1109\/ACCESS.2024.3352605","volume":"12","author":"S Tong","year":"2024","unstructured":"Tong S, Li J, Fu W (2024) An efficient and scalable Byzantine fault-tolerant consensus mechanism based on credit scoring and aggregated signatures [J]. IEEE Access 12:10393\u201310410","journal-title":"IEEE Access"},{"key":"2203_CR26","doi-asserted-by":"publisher","unstructured":"Du J, Yu Z, Sun A, et al (2025) Secure task offloading in blockchain-enabled MEC networks with improved PBFT consensus [J]. IEEE\u00a0Trans Cogn Commun Netw 11(2):1225\u20131243.\u00a0https:\/\/doi.org\/10.1109\/TCCN.2024.3454280","DOI":"10.1109\/TCCN.2024.3454280"},{"issue":"23","key":"2203_CR27","doi-asserted-by":"publisher","first-page":"23200","DOI":"10.1109\/JSEN.2022.3215152","volume":"22","author":"M Feng","year":"2022","unstructured":"Feng M, Zheng J, He S et al (2022) CRBFT: an optimized blockchain algorithm for edge-based IoT system [J]. IEEE Sens J 22(23):23200\u201323208","journal-title":"IEEE Sens J"},{"key":"2203_CR28","unstructured":"Goyal NK, Kumari M, Kushwah V et al (2024) Evaluating blockchain security: trade-offs in consensus mechanisms. In: Proceedings of the 2nd International Conference on Pervasive Computing Advances and Applications (PerCAA 2024), F 18\u201319, 2024 [C]"},{"issue":"4","key":"2203_CR29","first-page":"11","volume":"57","author":"GZ Wang","year":"2020","unstructured":"Wang GZ, Lv GH, Jia WC et al (2020) A review on the application of machine learning in SDN routing optimization [J]. J Comput Res Dev 57(4):11","journal-title":"J Comput Res Dev"},{"issue":"7","key":"2203_CR30","doi-asserted-by":"publisher","first-page":"9065","DOI":"10.1007\/s10586-024-04509-0","volume":"27","author":"A Ghaffari","year":"2024","unstructured":"Ghaffari A, Jelodari N, Pouralish S et al (2024) Securing internet of things using machine and deep learning methods: a survey [J]. Cluster Comput 27(7):9065\u20139089","journal-title":"Cluster Comput"},{"issue":"4","key":"2203_CR31","doi-asserted-by":"crossref","first-page":"166198","DOI":"10.1016\/j.ijleo.2020.166198","volume":"228","author":"Seyednezhad Rogaieh","year":"2021","unstructured":"Seyednezhad R, Derakhshanfard N, Heikalabad SR (2021) Routing design in optical networks-on-chip based on gray code for optical loss reduction [J]. Optik - Int J Light Electron Optics 228(4):166198","journal-title":"Optik - International Journal for Light and Electron Optics"},{"issue":"2","key":"2203_CR32","first-page":"1","volume":"110","author":"N Derakhshanfard","year":"2020","unstructured":"Derakhshanfard N (2020) Erlang based buffer management and routing in opportunistic networks [J]. Wirel Pers Commun 110(2):1\u201313","journal-title":"Wirel Pers Commun"},{"key":"2203_CR33","unstructured":"Liu R, Xing P, Deng Z et al (2022) Federated graph neural networks: overview, techniques and challenges [J].Journal of Latex Class Files 14(8)"},{"issue":"05","key":"2203_CR34","first-page":"1019","volume":"46","author":"X Xiao","year":"2023","unstructured":"Xiao X, Tang Z, Xiao B et al (2023) A survey on privacy and security issues in federated learning [J]. Chinese J Comput 46(05):1019\u20131044","journal-title":"Chinese J Comput"},{"issue":"03","key":"2203_CR35","first-page":"436","volume":"36","author":"ZS Pan","year":"2021","unstructured":"Pan ZS, Li W (2021) Review of spatio-temporal sequence prediction methods based on deep learning [J]. J Data Acquis Process 36(03):436\u2013448","journal-title":"J Data Acquis Process"},{"issue":"06","key":"2203_CR36","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1360\/SSI-2021-0336","volume":"52","author":"DL Luo","year":"2022","unstructured":"Luo DL, Cai YX, Yang ZH et al (2022) Survey on industrial defect detection with deep learning [J]. Scientia Sinica (Informationis) 52(06):1002\u20131039","journal-title":"Scientia Sinica (Informationis)"},{"issue":"S01","key":"2203_CR37","first-page":"681","volume":"50","author":"PL Tan","year":"2023","unstructured":"Tan PL, Wang RS, Zeng WH et al (2023) Overview of blockchain consensus algorithms [J]. Comput Sci 50(S01):681\u2013692","journal-title":"Comput Sci"},{"issue":"1","key":"2203_CR38","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TDSC.2016.2530720","volume":"15","author":"X Meng","year":"2018","unstructured":"Meng X, Liu D (2018) GeTrust: a guarantee-based trust model in Chord-based P2P networks [J]. IEEE Trans Depend Secure Comput 15(1):54\u201368","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"2203_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58529-7_16","volume-title":"Topology-preserving class-incremental learning [J]","author":"X Tao","year":"2020","unstructured":"Tao X, Chang X, Hong X et al (2020) Topology-preserving class-incremental learning [J]. Springer, Cham"},{"issue":"23","key":"2203_CR40","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/TWC.2023.3293709","volume":"3","author":"L Zhang","year":"2024","unstructured":"Zhang L, Zhang B, Li C (2024) An efficient and reliable byzantine fault tolerant blockchain consensus protocol for single-hop wireless networks [J]. IEEE Trans Wireless Commun 3(23):1974\u20131987","journal-title":"IEEE Trans Wireless Commun"},{"key":"2203_CR41","first-page":"127","volume":"10","author":"GY Wu","year":"2022","unstructured":"Wu GY (2022) Research on countermeasures of network crimes infringing upon citizens\u2019 personal information from the perspective of cost-benefit model [J]. Network Secur Technol Appl 10:127\u2013130","journal-title":"Network Secur Technol Appl"},{"key":"2203_CR42","doi-asserted-by":"crossref","unstructured":"Yu L, Wu Y, Lu J et al. An adaptive reputation update mechanism for primary nodes in PBFT. In: Proceedings of the 2024 IEEE 23rd international conference on trust, security and privacy in computing and communications (TrustCom), F]","DOI":"10.1109\/TrustCom63139.2024.00270"},{"key":"2203_CR43","doi-asserted-by":"publisher","first-page":"109541","DOI":"10.1016\/j.comnet.2022.109541","volume":"222","author":"J Tian","year":"2023","unstructured":"Tian J, Tian J, Xu H (2023) TSBFT: a scalable and efficient leaderless byzantine consensus for consortium blockchain [J]. Comput Networks 222:109541","journal-title":"Comput Networks"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-026-02203-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-026-02203-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-026-02203-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:38:10Z","timestamp":1774334290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-026-02203-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,24]]},"references-count":43,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["2203"],"URL":"https:\/\/doi.org\/10.1007\/s12083-026-02203-z","relation":{},"ISSN":["1936-6450"],"issn-type":[{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,24]]},"assertion":[{"value":"29 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"66"}}