{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:17:07Z","timestamp":1768591027996,"version":"3.49.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development 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":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3305375","type":"journal-article","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T17:40:47Z","timestamp":1692121247000},"page":"90335-90344","source":"Crossref","is-referenced-by-count":2,"title":["Joint Reputation Based Grouping and Hierarchical Byzantine Fault Tolerance Consensus Protocol"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8888-0248","authenticated-orcid":false,"given":"Hao","family":"Qin","sequence":"first","affiliation":[{"name":"School of Communication and Information Engineering, Shanghai University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yepeng","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Communication and Information Engineering, Shanghai University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2021.01.023"},{"key":"ref35","article-title":"SBFT: A scalable and decentralized trust infrastructure","author":"gueta","year":"2018","journal-title":"arXiv 1804 01626"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2019.2963437"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646052"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2969706"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICIICT1.2019.8741353"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2019.12.008"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2022.01.029","article-title":"SG-PBFT: A secure and highly efficient distributed blockchain PBFT consensus algorithm for intelligent Internet of Vehicles","volume":"164","author":"xu","year":"2022","journal-title":"J Parallel Distrib Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3029781"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/s22124590"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/fi12080122"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/9952218"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2020\/v13i07\/149691"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.05.007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCS.2017.8014672"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2017.36"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2018.095647"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/fi12080129"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"ref26","article-title":"Improved PBFT consensus mechanism based on kg medoids","volume":"46","author":"chenzh","year":"2019","journal-title":"Comput Sci"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/2115641"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013778"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3042392"},{"key":"ref21","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":"ref28","first-page":"3236","article-title":"Improvement of PBFT algorithm based on network self-clustering","volume":"38","author":"gao","year":"2021","journal-title":"Journal of Applied Computing Research"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00252"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3153701"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2019.2901746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6693731"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2942190"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3049915"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102397"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10217811.pdf?arnumber=10217811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T18:14:45Z","timestamp":1695060885000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10217811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3305375","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}