{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:38:21Z","timestamp":1774373901399,"version":"3.50.1"},"reference-count":37,"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":[{"name":"Major Project of Xinjiang Uygur Autonomous Region","award":["2020A03001"],"award-info":[{"award-number":["2020A03001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3264011","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T17:37:37Z","timestamp":1680543457000},"page":"33509-33519","source":"Crossref","is-referenced-by-count":24,"title":["A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2283-7093","authenticated-orcid":false,"given":"Wangxi","family":"Jiang","sequence":"first","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, &#x00DC;r&#x00FC;mqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxiong","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, &#x00DC;r&#x00FC;mqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyang","family":"Song","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, &#x00DC;r&#x00FC;mqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwei","family":"Qin","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, &#x00DC;r&#x00FC;mqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5182-4929","authenticated-orcid":false,"given":"Zhenhong","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, &#x00DC;r&#x00FC;mqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto","year":"2008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocx068"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/BigDataCongress.2017.85"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/AIMS.2017.31"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311900"},{"key":"ref7","first-page":"305","article-title":"In search of an understandable consensus algorithm","volume-title":"Proc. USENIX Conf. USENIX Annu. Tech. Conf.","author":"Ongaro"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"ref10","article-title":"Delegated proof of stake (DPoS)","author":"Larimer","year":"2014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref12","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume-title":"Proc. OSDI","volume":"99","author":"Castro"},{"issue":"11","key":"ref13","first-page":"2011","article-title":"Development status and prospect of blockchain consensus algorithm","volume":"44","author":"Yuan","year":"2018","journal-title":"Acta Automatica Sinica"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2018.8500708"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2018.8500488"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-08587-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3192426"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3189200"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SOLI48380.2019.8955093"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891065"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2019.12.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NaNA.2019.00066"},{"key":"ref24","volume-title":"NEO Consensus Mechanism","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.01.029"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2018.8433150"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITNEC.2019.8728972"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3214213"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978389"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN.2018.8343211"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP52459.2021.9613185"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00252"},{"issue":"12","key":"ref35","first-page":"101","article-title":"Improved PBFT consensus mechanism based on K-medoids","volume":"46","author":"Chen","year":"2019","journal-title":"Comput. Sci."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/app8101919"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-021-01103-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3042392"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10091103.pdf?arnumber=10091103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T20:52:39Z","timestamp":1709239959000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10091103\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3264011","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}