{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T01:24:04Z","timestamp":1785893044968,"version":"3.56.0"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2021201052"],"award-info":[{"award-number":["F2021201052"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The traditional practical Byzantine fault tolerance (PBFT) consensus algorithm has limitations due to its failure to consider node credibility and its static structure, leading to reduced adaptability and increased communication overhead, particularly when dealing with Byzantine nodes. To address these issues, we propose a multilevel adaptive practical Byzantine fault tolerance algorithm (MAPBFT) based on PBFT and incorporating adaptive techniques, including a discourse power mechanism. MAPBFT initially uses a reputation model to evaluate node parameters such as past performance, reliability, availability, and response delay, providing predictive insights for the adaptive algorithm. The adaptive algorithm then employs a multi-layer perceptron to predict the reputation scores of nodes. This enables the selection of high-reputation nodes for consensus participation, narrowing the consensus scope, and reducing communication overhead. Finally, discourse power is distributed differentially based on node reputation scores. The consensus advancement criterion is modified to a threshold achieved through accumulated discourse power, focusing the system on high-reputation nodes and enhancing consensus efficiency and resistance against malicious nodes. We conducted experiments to validate MAPBFT\u2019s performance and compared it with PBFT and APBFT. Experimental results demonstrate that MAPBFT enhances throughput, reduces response delay and communication overhead, and improves security, outperforming the other protocols.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae137","type":"journal-article","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T07:31:46Z","timestamp":1735371106000},"page":"635-648","source":"Crossref","is-referenced-by-count":3,"title":["MAPBFT: multilevel adaptive PBFT algorithm based on discourse and reputation models"],"prefix":"10.1093","volume":"68","author":[{"given":"Xin","family":"Wen","sequence":"first","affiliation":[{"name":"School of Cyber Security and Computer , Hebei University, 2666 Qiyi East Road, Lianchi District, Baoding 071000, Hebei Province,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohui","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Cyber Security and Computer , Hebei University, 2666 Qiyi East Road, Lianchi District, Baoding 071000, Hebei Province,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"2025062421131468300_ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3417987","article-title":"Security and privacy in IoT using machine learning and blockchain: threats and countermeasures","volume":"53","author":"Waheed","year":"2020","journal-title":"ACM Comput Surv"},{"key":"2025062421131468300_ref2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3158369","article-title":"Security and privacy on blockchain","volume":"52","author":"Zhang","year":"2019","journal-title":"ACM Comput Surv"},{"key":"2025062421131468300_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-019-2790-1","article-title":"A survey of blockchain consensus algorithms: mechanism, design and applications","volume":"64","author":"Fu","year":"2021","journal-title":"Sci China Inf Sci"},{"key":"2025062421131468300_ref4","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume-title":"Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Castro","year":"1999"},{"key":"2025062421131468300_ref5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1117\/12.2653577","article-title":"Improvement of practical Byzantine fault tolerance algorithm based on node reputation value matching","volume-title":"Second International Symposium on Computer Technology and Information Science (ISCTIS 2022)","author":"Cui","year":"2022"},{"key":"2025062421131468300_ref6","first-page":"1","article-title":"A secure medical information storage and sharing method based on multiblockchain architecture","volume":"10","author":"Hu","year":"2024","journal-title":"IEEE Trans Comput"},{"key":"2025062421131468300_ref7","first-page":"339","article-title":"An improved PBFT consensus algorithm for supply chain finance","volume-title":"Blockchain and Trustworthy Systems. Block Sys 2023. Communications in Computer and Information Science","author":"Zhang","year":"2023"},{"key":"2025062421131468300_ref8","doi-asserted-by":"crossref","first-page":"1952","DOI":"10.1109\/IAEAC59436.2024.10503612","article-title":"GR-PBFT: optimization of PBFT consensus algorithm for supply chain traceability","volume-title":"2024 IEEE 7th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","author":"Li","year":"2024"},{"key":"2025062421131468300_ref9","doi-asserted-by":"crossref","first-page":"3392","DOI":"10.1109\/JIOT.2023.3296460","article-title":"BFOD: blockchain-based privacy protection and security sharing scheme of flight operation data","volume":"11","author":"Li","year":"2024","journal-title":"IEEE Internet Things J"},{"key":"2025062421131468300_ref10","doi-asserted-by":"crossref","first-page":"107922","DOI":"10.1016\/j.comcom.2024.08.004","article-title":"Improved dynamic byzantine fault tolerant consensus mechanism","volume":"226","author":"Tang","year":"2024","journal-title":"Comput Commun"},{"key":"2025062421131468300_ref11","first-page":"1","article-title":"A survey of blockchain consensus protocols","volume":"55","author":"Xu","year":"2023","journal-title":"ACM Comput Surv"},{"key":"2025062421131468300_ref12","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.3390\/electronics12061460","article-title":"Improvement of PBFT algorithm based on CART","volume":"6","author":"Liu","year":"2023","journal-title":"Electronics"},{"key":"2025062421131468300_ref13","doi-asserted-by":"crossref","DOI":"10.1109\/ACCESS.2023.3298675","article-title":"Sok: A taxonomy for critical analysis of consensus mechanisms in consortium blockchain","author":"Yao","year":"2023"},{"key":"2025062421131468300_ref14","doi-asserted-by":"crossref","first-page":"3801","DOI":"10.3390\/electronics12183801","article-title":"Byzantine fault-tolerant consensus algorithms: a survey","volume":"12","author":"Zhong","year":"2023","journal-title":"Electronics"},{"key":"2025062421131468300_ref15","doi-asserted-by":"crossref","DOI":"10.1007\/s11276-023-03636-7","article-title":"A high-capacity slicing PBFT protocol based on reputation evaluation model","volume":"30","author":"Chen","year":"2024","journal-title":"Wireless Netw"},{"key":"2025062421131468300_ref16","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/TC.2024.3377921","article-title":"A dynamic adaptive framework for practical Byzantine fault tolerance consensus protocol in the internet of things","volume":"73","author":"Li","year":"2024","journal-title":"IEEE Trans Comput"},{"key":"2025062421131468300_ref17","doi-asserted-by":"crossref","first-page":"111224","DOI":"10.1016\/j.automatica.2023.111224","article-title":"Secure multi-dimensional consensus algorithm against malicious attacks","volume":"157","author":"Luo","year":"2023","journal-title":"Automatica"},{"key":"2025062421131468300_ref18","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1007\/s12083-021-01103-8","article-title":"An optimized Byzantine fault tolerance algorithm for consortium blockchain","volume":"14","author":"Li","year":"2021","journal-title":"Peer Peer Netw Appl"},{"key":"2025062421131468300_ref19","first-page":"795","article-title":"An improved scheme of practical Byzantine fault tolerant algorithm","volume-title":"The International Conference on Forthcoming Networks and Sustainability (FoNeS 2022)","author":"Sui","year":"2022"},{"key":"2025062421131468300_ref20","doi-asserted-by":"crossref","first-page":"110404","DOI":"10.1016\/j.comnet.2024.110404","article-title":"BFTDiagnosis: an automated security testing framework with malicious behavior injection for BFT protocols","volume":"249","author":"Wang","year":"2024","journal-title":"Comput Netw"},{"key":"2025062421131468300_ref21","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/MNET.001.1800290","article-title":"A survey on the scalability of blockchain systems","volume":"33","author":"Xie","year":"2019","journal-title":"IEEE Netw"},{"key":"2025062421131468300_ref22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/3457337.3457843","article-title":"An optimization strategy for PBFT consensus mechanism based on consortium blockchain","volume-title":"Proceedings of the 3rd ACM International Symposium on Blockchain and Secure Critical Infrastructure","author":"Wang","year":"2021"},{"key":"2025062421131468300_ref23","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1145\/3548606.3559379","article-title":"Dumbo-NG: fast asynchronous BFT consensus with throughput-oblivious latency","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"Gao","year":"2022"},{"key":"2025062421131468300_ref24","first-page":"2307","article-title":"LBlockchainE: a lightweight blockchain for edge IoT-enabled maritime transportation systems","volume":"24","author":"Jiang","year":"2022","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2025062421131468300_ref25","first-page":"304","article-title":"PDMSC: privacy-preserving decentralized multi-skill spatial crowdsourcing","volume":"20","author":"Meng","year":"2024","journal-title":"Int J Web Inf Syst"},{"key":"2025062421131468300_ref26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.ject.2024.05.001","article-title":"Quantum cloud computing: trends and challenges","volume":"2","author":"Golec","year":"2024","journal-title":"J Econ Technol"},{"key":"2025062421131468300_ref27","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1007\/s40747-022-00857-9","article-title":"Primary node election based on probabilistic linguistic term set with confidence interval in the PBFT consensus mechanism for blockchain","volume":"9","author":"Xie","year":"2023","journal-title":"Complex Intell Syst"},{"key":"2025062421131468300_ref28","doi-asserted-by":"crossref","first-page":"2880","DOI":"10.1093\/comjnl\/bxac131","article-title":"A robust blockchain-based distribution master for distributing root zone data In DNS","volume":"65","author":"Liu","year":"2022","journal-title":"Comput J"},{"key":"2025062421131468300_ref29","first-page":"25","article-title":"Improved PBFT algorithm of multi-primary-node based on ring of consistent hash","volume":"29","author":"Li","year":"2023","journal-title":"Int J Comput Integr Manuf"},{"key":"2025062421131468300_ref30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","article-title":"T-PBFT: an Eigen Trust-based practical Byzantine fault tolerance consensus algorithm","volume":"16","author":"Gao","year":"2019","journal-title":"China Commun"},{"key":"2025062421131468300_ref31","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/s12083-022-01408-2","article-title":"Practical Byzantine fault tolerance consensus based on comprehensive reputation","volume":"16","author":"Qi","year":"2023","journal-title":"Peer Peer Netw Appl"},{"key":"2025062421131468300_ref32","doi-asserted-by":"crossref","first-page":"11440","DOI":"10.1109\/JIOT.2023.3243189","article-title":"A two-stage PBFT architecture with trust and reward incentive mechanism","volume":"10","author":"Qushtom","year":"2023","journal-title":"IEEE Internet Things J"},{"key":"2025062421131468300_ref33","doi-asserted-by":"crossref","first-page":"106590","DOI":"10.1016\/j.compbiomed.2023.106590","article-title":"P-PBFT: an improved blockchain algorithm to support large-scale pharmaceutical traceability","volume":"154","author":"Liu","year":"2023","journal-title":"Comput Biol Med"},{"key":"2025062421131468300_ref34","first-page":"100609","article-title":"R-PBFT: a secure and intelligent consensus algorithm for internet of vehicles","volume":"41","author":"Kumar","year":"2023","journal-title":"Veh Commun"},{"key":"2025062421131468300_ref35","doi-asserted-by":"crossref","DOI":"10.1109\/TCE.2024.3412957","article-title":"Reputation-based stable blockchain sharding scheme for smart cities with IoT consumer electronics: a deep reinforcement learning approach","volume":"70","author":"Li","year":"2024","journal-title":"IEEE Trans Consum Electron"},{"key":"2025062421131468300_ref36","first-page":"195","article-title":"Graph-based multi-information integration network with external news environment perception for propaganda detection","volume":"20","author":"Liu","year":"2024","journal-title":"Int J Web Inf Syst"},{"key":"2025062421131468300_ref37","doi-asserted-by":"crossref","first-page":"3085","DOI":"10.1007\/s40747-022-00907-2","article-title":"A node selection algorithm with a genetic method based on PBFT in consortium blockchains","volume":"9","author":"Zhang","year":"2023","journal-title":"Complex Intell Syst"},{"key":"2025062421131468300_ref38","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.ins.2022.12.068","article-title":"ABC-GSPBFT: PBFT with grouping score mechanism and optimized consensus process for flight operation data-sharing","volume":"624","author":"Xu","year":"2023","journal-title":"Inform Sci"},{"key":"2025062421131468300_ref39","article-title":"APBFT: an adaptive PBFT consensus for private blockchains","volume-title":"IEEE Global Communications Conference, GLOBECOM","author":"Riahi","year":"1788\u20131793"},{"key":"2025062421131468300_ref40","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1093\/comjnl\/bxaa109","article-title":"Breast cancer diagnosis using multi-stage weight adjustment in the MLP neural network","volume":"65","author":"Rezaeipanah","year":"2022","journal-title":"Comput J"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/6\/635\/61286409\/bxae137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/6\/635\/61286409\/bxae137.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T01:13:23Z","timestamp":1750814003000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/6\/635\/7933711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":40,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,12,27]]},"published-print":{"date-parts":[[2025,6,12]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae137","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,6]]},"published":{"date-parts":[[2024,12,27]]}}}