{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:53:11Z","timestamp":1769723591340,"version":"3.49.0"},"reference-count":25,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Project","award":["2018YFB1404400"],"award-info":[{"award-number":["2018YFB1404400"]}]},{"name":"National Key Research and Development Project","award":["62062030"],"award-info":[{"award-number":["62062030"]}]},{"name":"National Key Research and Development Project","award":["620RC620"],"award-info":[{"award-number":["620RC620"]}]},{"name":"National Key Research and Development Project","award":["2020-009"],"award-info":[{"award-number":["2020-009"]}]},{"name":"National Key Research and Development Project","award":["ZDYF2021SHFZ243"],"award-info":[{"award-number":["ZDYF2021SHFZ243"]}]},{"name":"National Natural Science Foundation of China","award":["2018YFB1404400"],"award-info":[{"award-number":["2018YFB1404400"]}]},{"name":"National Natural Science Foundation of China","award":["62062030"],"award-info":[{"award-number":["62062030"]}]},{"name":"National Natural Science Foundation of China","award":["620RC620"],"award-info":[{"award-number":["620RC620"]}]},{"name":"National Natural Science Foundation of China","award":["2020-009"],"award-info":[{"award-number":["2020-009"]}]},{"name":"National Natural Science Foundation of China","award":["ZDYF2021SHFZ243"],"award-info":[{"award-number":["ZDYF2021SHFZ243"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["2018YFB1404400"],"award-info":[{"award-number":["2018YFB1404400"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["62062030"],"award-info":[{"award-number":["62062030"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["620RC620"],"award-info":[{"award-number":["620RC620"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["2020-009"],"award-info":[{"award-number":["2020-009"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["ZDYF2021SHFZ243"],"award-info":[{"award-number":["ZDYF2021SHFZ243"]}]},{"name":"Major Science and Technology Project of Haikou","award":["2018YFB1404400"],"award-info":[{"award-number":["2018YFB1404400"]}]},{"name":"Major Science and Technology Project of Haikou","award":["62062030"],"award-info":[{"award-number":["62062030"]}]},{"name":"Major Science and Technology Project of Haikou","award":["620RC620"],"award-info":[{"award-number":["620RC620"]}]},{"name":"Major Science and Technology Project of Haikou","award":["2020-009"],"award-info":[{"award-number":["2020-009"]}]},{"name":"Major Science and Technology Project of Haikou","award":["ZDYF2021SHFZ243"],"award-info":[{"award-number":["ZDYF2021SHFZ243"]}]},{"name":"Key R&amp;D Project of Hainan province","award":["2018YFB1404400"],"award-info":[{"award-number":["2018YFB1404400"]}]},{"name":"Key R&amp;D Project of Hainan province","award":["62062030"],"award-info":[{"award-number":["62062030"]}]},{"name":"Key R&amp;D Project of Hainan province","award":["620RC620"],"award-info":[{"award-number":["620RC620"]}]},{"name":"Key R&amp;D Project of Hainan province","award":["2020-009"],"award-info":[{"award-number":["2020-009"]}]},{"name":"Key R&amp;D Project of Hainan province","award":["ZDYF2021SHFZ243"],"award-info":[{"award-number":["ZDYF2021SHFZ243"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In service-transaction scenarios, blockchain technology is widely used as an effective tool for establishing trust between service providers and consumers. The consensus algorithm is the core technology of blockchain. However, existing consensus algorithms, such as the practical Byzantine fault tolerance (PBFT) algorithm, still suffer from high resource consumption and latency. To solve this problem, in this study, we propose an improved PBFT blockchain consensus algorithm based on quality of service (QoS)-aware trust service evaluation for secure and efficient service transactions. The proposed algorithm, called the QoS-aware trust practical Byzantine fault tolerance (QTPBFT) algorithm, efficiently achieves consensus, significantly reduces resource consumption, and enhances consensus efficiency. QTPBFT incorporates a QoS-aware trust service global evaluation mechanism that implements service reliability ranking by conducting a dynamic evaluation according to the real-time performance of the services. To reduce the traffic of the blockchain, it uses a mechanism that selects nodes with higher values to form a consensus group that votes for consensus according to the global evaluation result of the trust service. A practical protocol is also constructed for the proposed algorithm. The results of extensive simulations and comparison with other schemes verify the efficacy and efficiency of the proposed scheme.<\/jats:p>","DOI":"10.3390\/s22124590","type":"journal-article","created":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T21:19:26Z","timestamp":1655673566000},"page":"4590","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Optimization of PBFT Algorithm Based on QoS-Aware Trust Service Evaluation"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2688-0427","authenticated-orcid":false,"given":"Wei","family":"Liu","sequence":"first","affiliation":[{"name":"School of Information and Communication Engineering, Hainan University, Haikou 570228, China"},{"name":"College of Biomedical Information and Engineering, Hainan Medical University, Haikou 571199, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, Hainan University, Haikou 570228, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenlong","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, Hainan University, Haikou 570228, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengxing","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, Hainan University, Haikou 570228, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, Wenchang Satellite Launch Center, Wenchang 571300, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,17]]},"reference":[{"key":"ref_1","unstructured":"Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. Decent. Bus. Rev., 21260. Available online: https:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"e00151","DOI":"10.1016\/j.jbvi.2019.e00151","article-title":"Blockchain disruption and decentralized finance: The rise of decentralized business models","volume":"13","author":"Chen","year":"2020","journal-title":"J. Bus. Ventur. Insights"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1111\/jbl.12240","article-title":"The struggle is real: Insights from a supply chain blockchain case","volume":"42","author":"Sternberg","year":"2021","journal-title":"J. Bus. Logist."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"116123","DOI":"10.1016\/j.apenergy.2020.116123","article-title":"A novel decentralized platform for peer-to-peer energy trading market with blockchain technology","volume":"282","author":"Esmat","year":"2021","journal-title":"Appl. Energy"},{"key":"ref_5","first-page":"102407","article-title":"Blockchain-based electronic healthcare record system for healthcare 4.0 applications","volume":"50","author":"Tanwar","year":"2020","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MNET.001.1900103","article-title":"Blockchain for managing heterogeneous internet of things: A perspective architecture","volume":"34","author":"Tseng","year":"2020","journal-title":"IEEE Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/TNSE.2020.2976697","article-title":"Blockchain-enabled accountability mechanism against information leakage in vertical industry services","volume":"8","author":"Xu","year":"2021","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1109\/TETC.2020.3005610","article-title":"A blockchain-enabled deduplicatable data auditing mechanism for network storage services","volume":"9","author":"Xu","year":"2021","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"ref_9","first-page":"173","article-title":"Practical byzantine fault tolerance","volume":"99","author":"Castro","year":"1999","journal-title":"OsDI"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1658357.1658358","article-title":"Zyzzyva: Speculative byzantine fault tolerance","volume":"27","author":"Kotla","year":"2010","journal-title":"ACM Trans. Comput. Syst."},{"key":"ref_11","unstructured":"Gueta, G.G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.A., Tamir, O., and Tomescu, A. (2019, January 14\u201327). Sbft: A scalable and decentralized trust infrastructure. Proceedings of the 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), Portland, OR, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Larrea, M., and Raynal, M. (2018, January 1\u20133). DBFT: Efficient leaderless Byzantine consensus and its application to blockchains. Proceedings of the 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA), Cambridge, MA, USA.","DOI":"10.1109\/NCA.2018.8548057"},{"key":"ref_13","first-page":"1049","article-title":"Ouroboros-BFT: A Simple Byzantine Fault Tolerant Consensus Protocol","volume":"2018","author":"Kiayias","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Aublin, P.L., Mokhtar, S.B., and Qu\u00e9ma, V. (2013, January 8\u201311). Rbft: Redundant byzantine fault tolerance. Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems, Philadelphia, PA, USA.","DOI":"10.1109\/ICDCS.2013.53"},{"key":"ref_15","unstructured":"Lev-Ari, K., Spiegelman, A., Keidar, I., and Malkhi, D. (2019). Fairledger: A fair blockchain protocol for financial institutions. arXiv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","article-title":"T-PBFT: An EigenTrust-based practical Byzantine fault tolerance consensus algorithm","volume":"16","author":"Gao","year":"2019","journal-title":"China Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/TPDS.2020.3042392","article-title":"A Scalable Multi-Layer PBFT Consensus for Blockchain","volume":"32","author":"Li","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"32022","DOI":"10.1088\/1742-6596\/1802\/3\/032022","article-title":"Research on Practical Byzantine Fault Tolerant Consensus Algorithm Based on Blockchain","volume":"1802","author":"Zheng","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_19","first-page":"1089","article-title":"Multi-attribute spatial node selection algorithm based on subjective and objective weighting","volume":"38","author":"Dai","year":"2018","journal-title":"J. Comput. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0270-0255(87)90473-8","article-title":"The analytic hierarchy process\u2014What it is and how it is used","volume":"9","author":"Saaty","year":"1987","journal-title":"Math. Model."},{"key":"ref_21","first-page":"2622","article-title":"Improved network security situational assessment method based on FAHP","volume":"34","author":"Li","year":"2014","journal-title":"J. Comput. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1504\/IJSA.2020.112091","article-title":"Aircraft selection process with technique for order preference by similarity to ideal solution and AHP integration","volume":"6","author":"Yilmaz","year":"2020","journal-title":"Int. J. Sustain. Aviat."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1007\/s40815-020-00914-w","article-title":"An enhanced technique for order preference by similarity to ideal solutions and its application to renewable energy resources selection problem","volume":"23","author":"Pan","year":"2021","journal-title":"Int. J. Fuzzy Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Al-Masri, E., and Mahmoud, Q.H. (2008, January 21\u201325). Investigating web services on the world wide web. Proceedings of the 17th International Vonference on World Wide Web, Beijing, China.","DOI":"10.1145\/1367497.1367605"},{"key":"ref_25","unstructured":"(2022, April 20). The QWS Dataset. Available online: https:\/\/qwsdata.github.io\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/12\/4590\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:33:59Z","timestamp":1760139239000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/12\/4590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":25,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["s22124590"],"URL":"https:\/\/doi.org\/10.3390\/s22124590","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]}}}