{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:30:13Z","timestamp":1762432213587,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"15","license":[{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&amp;D Program of China","doi-asserted-by":"publisher","award":["2020YFC1523004"],"award-info":[{"award-number":["2020YFC1523004"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>A blockchain has been applied in many areas, such as cryptocurrency, smart cities and digital finance. The consensus protocol is the core part of the blockchain network, which addresses the problem of transaction consistency among the involved participants. However, the scalability, efficiency and security of the consensus protocol are greatly restricted with the increasing number of nodes. A Hierarchy Byzantine Fault Tolerance consensus protocol (HBFT) based on node reputation has been proposed. The two-layer hierarchy structure is designed to improve the scalability by assigning nodes to different layers. Each node only needs to exchange messages within its group, which deducts the communication complexity between nodes. Specifically, a reputation model is proposed to distinguish normal nodes from malicious ones by a punish and reward mechanism. It is applied to ensure that the malicious node merely existing in the bottom layer and the communication complexity in the high layer can be further lowered. Finally, a random selection mechanism is applied in the selection of the leader node. The mechanism can ensure the security of the blockchain network with the characteristics of unpredictability and randomicity. Some experimental results demonstrated that the proposed consensus protocol has excellent performance in comparison to some state-of-the-art models.<\/jats:p>","DOI":"10.3390\/s22155887","type":"journal-article","created":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T04:16:55Z","timestamp":1660018615000},"page":"5887","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Hierarchy Byzantine Fault Tolerance Consensus Protocol Based on Node Reputation"],"prefix":"10.3390","volume":"22","author":[{"given":"Xixi","family":"Wang","sequence":"first","affiliation":[{"name":"School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yepeng","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China"},{"name":"Key Laboratory of Advanced Display and System Application, Ministry of Education, Shanghai 200072, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4177","DOI":"10.1109\/TII.2019.2942190","article-title":"Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT","volume":"16","author":"Lu","year":"2020","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4660","DOI":"10.1109\/JIOT.2018.2875542","article-title":"Blockchain for Secure and Efficient Data Sharing in Vehicular Edge Computing and Networks","volume":"6","author":"Kang","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MNET.2018.1700344","article-title":"Blockchain-Enabled Security in Electric Vehicles Cloud and Edge Computing","volume":"32","author":"Liu","year":"2018","journal-title":"IEEE Netw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1109\/COMST.2019.2894727","article-title":"Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges","volume":"21","author":"Yang","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_5","first-page":"117","article-title":"Incentivizing Honest Mining in Blockchain Networks: A Reputation Approach","volume":"67","author":"Tang","year":"2020","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"6257","DOI":"10.1109\/JIOT.2020.3029781","article-title":"Voting-based decentralized consensus design for improving the efficiency and security of consortium blockchain","volume":"8","author":"Sun","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.comcom.2021.01.023","article-title":"Private blockchain-envisioned multi-authority CP-ABE-based user access control scheme in IIoT","volume":"169","author":"Banerjee","year":"2021","journal-title":"Comput. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.future.2017.09.023","article-title":"From blockchain consensus back to Byzantine consensus","volume":"107","author":"Gramoli","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18564\/jasss.4289","article-title":"Impacts of Consensus Protocols and Trade Network Topologies on Blockchain System Performance","volume":"23","author":"Wei","year":"2020","journal-title":"J. Artif. Soc. Soc. Simul."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., and Juels, A. (1999, January 20\u201321). Proofs of work and bread pudding protocols. Proceedings of the IFIP TC6\/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security, Deventer, The Netherlands.","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"ref_11","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., and Russell, A. (May, January 29). Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, B., Li, Z., and Li, H. (2020). Hybrid Consensus Algorithm Based on Modified Proof-of-Probability and DPoS. Future Internet, 12.","DOI":"10.3390\/fi12080122"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/MNET.2019.1900002","article-title":"When Internet of Things Meets Blockchain: Challenges in Distributed Consensus","volume":"33","author":"Cao","year":"2019","journal-title":"IEEE Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/571637.571640","article-title":"Practical byzantine fault tolerance and proactive recovery","volume":"20","author":"Castro","year":"2002","journal-title":"ACM Trans. Comput. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TDSC.2019.2926723","article-title":"Recovery Algorithms for Paxos-Based State Machine Replication","volume":"18","author":"Wojciechowski","year":"2021","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/LWC.2020.2971469","article-title":"RAFT Based Wireless Blockchain Networks in the Presence of Malicious Jamming","volume":"9","author":"Xu","year":"2020","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Sukhwani, H., Martinez, J.M., Chang, X., Trivedi, K.S., and Rindos, A. (2017, January 26\u201329). Performance Modeling of PBFT Consensus Process for Permissioned Blockchain Network. Proceedings of the IEEE Symposium on Reliable Distributed Systems, Hong Kong, China.","DOI":"10.1109\/SRDS.2017.36"},{"key":"ref_18","unstructured":"Fan, X. (2018, January 29\u201331). Scalable practical byzantine fault tolerance with short-lived signature schemes. Proceedings of the 28th Annual International Conference on Computer Science and Software Engineering, Markham, ON, Canada."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Drijvers, M., Edalatnejad, K., Ford, B., Kiltz, E., Loss, J., Neven, G., and Stepanovs, I. (2019, January 19\u201323). On the security of two-round multi-signatures. Proceedings of the IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2019.00050"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Syta, E., Tamas, I., Visher, D., Wolinsky, D.I., Jovanovic, P., Gasser, L., Gailly, N., Khoffi, I., and Ford, B. (2016, January 22\u201326). Keeping Authorities \u201cHonest or Bust\u201d with Decentralized Witness Cosigning. Proceedings of the IEEE Symposium on Security and Privacy, San Jose, CA, USA.","DOI":"10.1109\/SP.2016.38"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2139","DOI":"10.1007\/s10623-019-00608-x","article-title":"Simple Schnorr multi-signatures with applications to Bitcoin","volume":"87","author":"Maxwell","year":"2019","journal-title":"Des. Codes Cryptogr."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TC.2018.2860009","article-title":"Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing","volume":"68","author":"Liu","year":"2019","journal-title":"IEEE Trans. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3233\/JHS-210653","article-title":"New public blockchain protocol based on sharding and aggregate signatures","volume":"27","author":"Fu","year":"2021","journal-title":"J. High Speed Netw."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4291","DOI":"10.1109\/JIOT.2020.3028449","article-title":"RepChain: A Reputation-Based Secure, Fast, and High Incentive Blockchain System via Sharding","volume":"8","author":"Huang","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., and Larrea, M. (2018, January 1\u20133). DBFT: Efficient leaderless byzantine consensus and its application to blockchains. Proceedings of the IEEE 17th International Symposium on Network Computing and Applications, Cambridge, MA, USA.","DOI":"10.1109\/NCA.2018.8548057"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Coelho, I.M., Coelho, V.N., Araujo, R.P., Qiang, W.Y., and Rhodes, B.D. (2020). Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT. Future Internet, 12.","DOI":"10.3390\/fi12080129"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"67890","DOI":"10.1109\/ACCESS.2021.3077650","article-title":"Optimized Data Storage Method for Sharding-Based Blockchain","volume":"9","author":"Jia","year":"2021","journal-title":"IEEE Access"},{"key":"ref_28","first-page":"143","article-title":"Design of tree topology based byzantine fault tolerance system","volume":"38","author":"Lv","year":"2017","journal-title":"J. Commun."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.inffus.2021.02.011","article-title":"A trusted consensus fusion scheme for decentralized collaborated learning in massive IoT domain","volume":"72","author":"Wang","year":"2021","journal-title":"Inf. Fusion"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/TC.2019.2900648","article-title":"RepuCoin: Your Reputation Is Your Power","volume":"68","author":"Yu","year":"2019","journal-title":"IEEE Trans. Comput."},{"key":"ref_31","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_32","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. (2017, January 28). Algorand: Scaling byzantine agreements for cryptocurrencies. Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China.","DOI":"10.1145\/3132747.3132757"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"039105","DOI":"10.1007\/s11432-017-9228-6","article-title":"Verifiable random functions with Boolean function constraints","volume":"61","author":"Wang","year":"2018","journal-title":"Sci. China Inf. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., and Shoup, V. (2001, January 19\u201323). Secure and efficient asynchronous broadcast protocols. Proceedings of the 21st Annual International Cryptology Conference, Berlin\/Heidelberg, Germany.","DOI":"10.1007\/3-540-44647-8_31"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"6916","DOI":"10.1109\/TII.2020.3029766","article-title":"Smart Collaborative Balancing for Dependable Network Components in Cyber-Physical Systems","volume":"17","author":"Song","year":"2021","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/LSENS.2021.3068184","article-title":"A Node Overhaul Scheme for Energy Efficient Clustering in Wireless Sensor Networks","volume":"5","author":"Singh","year":"2021","journal-title":"IEEE Sens. Lett."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/15\/5887\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:05:14Z","timestamp":1760141114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/15\/5887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,6]]},"references-count":36,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["s22155887"],"URL":"https:\/\/doi.org\/10.3390\/s22155887","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2022,8,6]]}}}