{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T02:12:51Z","timestamp":1774404771669,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T00:00:00Z","timestamp":1714694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T00:00:00Z","timestamp":1714694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11227-024-06122-9","type":"journal-article","created":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T08:02:16Z","timestamp":1714723336000},"page":"17849-17873","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["LC-PBFT: Layered cross-chain consensus algorithm based on forest topology"],"prefix":"10.1007","volume":"80","author":[{"given":"Jinhui","family":"Li","sequence":"first","affiliation":[]},{"given":"Lifeng","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Shoucai","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jiling","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Jinlong","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"issue":"24","key":"6122_CR1","first-page":"107","volume":"57","author":"KQ Yang","year":"2021","unstructured":"Yang KQ, Wang YX, Guo B, Li Q (2021) Improvement and research of delegated proof of stake consensus mechanism. Comput Eng Appl 57(24):107\u2013114","journal-title":"Comput Eng Appl"},{"issue":"10","key":"6122_CR2","first-page":"3086","volume":"37","author":"Y Gao","year":"2020","unstructured":"Gao Y, Tan XC (2020) Improvement of DPOS consensus mechanism. Appl Res Comput 37(10):3086\u20133090","journal-title":"Appl Res Comput"},{"issue":"5","key":"6122_CR3","first-page":"458","volume":"5","author":"XM Si","year":"2018","unstructured":"Si XM, Xu MX, Yuan C (2018) Survey on security of blockchain. J Cryptol Res 5(5):458\u2013469","journal-title":"J Cryptol Res"},{"issue":"18","key":"6122_CR4","first-page":"8","volume":"7","author":"M Zheng","year":"2019","unstructured":"Zheng M, Wang H, Liu H, Tang C (2019) Survey on consensus algorithms of blockchain. Netinfo Sec 7(18):8\u201324","journal-title":"Netinfo Sec"},{"key":"6122_CR5","doi-asserted-by":"crossref","unstructured":"Wang P, Liu X, Chen J, Zhan Y, Jin Z (2018) Poster: QoS-Aware service composition using blockchain-based smart contracts, In: 2018 IEEE\/ACM 40th International Conference on Software Engineering: Companion Proceedings, Gothenburg, Sweden, 27 May-3","DOI":"10.1145\/3183440.3194978"},{"key":"6122_CR6","doi-asserted-by":"crossref","unstructured":"Mermer GB, Zeydan E, Arslan SS (May2018) An overview of blockchain technologies: Principles, opportunities and challenges. Signal Processing and Communications Applications Conference. Izmir, Turkey, pp 2\u20135","DOI":"10.1109\/SIU.2018.8404513"},{"issue":"7","key":"6122_CR7","first-page":"2162","volume":"39","author":"JC Huang","year":"2019","unstructured":"Huang JC, Xu XH, Wang SC (2019) Improved scheme of delegated proof of stake consensus mechanism. J Comput Appl 39(7):2162\u20132167","journal-title":"J Comput Appl"},{"key":"6122_CR8","unstructured":"Castro M, Liskov B (1999) Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, pp.173-186"},{"key":"6122_CR9","doi-asserted-by":"crossref","unstructured":"Miller A, Xia Y, Croman K, et al (2016) The honey badger of BFT protocols. In: ACM SIGSAC on Computer and Communications Security, pp. 31-42","DOI":"10.1145\/2976749.2978399"},{"key":"6122_CR10","doi-asserted-by":"publisher","first-page":"108431","DOI":"10.1016\/j.comnet.2021.108431","volume":"199","author":"R Arnold","year":"2021","unstructured":"Arnold R, Longley D (2021) Continuity: A deterministic Byzantine fault tolerant asynchronous consensus algorithm. Comput Netw 199:108431","journal-title":"Comput Netw"},{"key":"6122_CR11","doi-asserted-by":"crossref","unstructured":"Guo BY, Lu ZL, Tang Q, Xu J, Zhang ZF (2020) \u201cDumbo: Faster Asynchronous BFT Protocols\u201d. In: 2020 ACM SIGSAC Conference on Computer and Communications Security, n. pag","DOI":"10.1145\/3372297.3417262"},{"key":"6122_CR12","doi-asserted-by":"crossref","unstructured":"Guo BY, Lu Y, Lu ZL, Tang Q, Xu J, Zhang ZF (2022) Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. IACR Cryptol. ePrint Arch., 27","DOI":"10.14722\/ndss.2022.24385"},{"key":"6122_CR13","unstructured":"Liu S, Viotti P, Cachin C, et al (2016) XFT: practical fault tolerance beyond crashes. Oper Syst Des Implement, pp. 485-500"},{"key":"6122_CR14","doi-asserted-by":"crossref","unstructured":"Abraham I, Malkhi D, Spiegelman A, et al (2019) Validated asynchronous Byzantine agreement with optimal resilience and asymptotically optimal time and word communication. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 337-346","DOI":"10.1145\/3293611.3331612"},{"issue":"12","key":"6122_CR15","first-page":"2315","volume":"48","author":"H Zheng","year":"2018","unstructured":"Zheng H, Guo W, Xiong N et al (2018) A kernel-based compressive sensing approach for mobile data gathering in wireless sensor network systems. Syst Man Cyber 48(12):2315\u20132327","journal-title":"Syst Man Cyber"},{"issue":"1","key":"6122_CR16","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TNSE.2018.2881152","volume":"7","author":"Y Liu","year":"2020","unstructured":"Liu Y, Ma M, Liu X et al (2020) Design and analysis of probing route to defense sink-hole attacks for Internet of things security. IEEE Trans Netw Sci Eng 7(1):356\u2013372","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"6122_CR17","doi-asserted-by":"publisher","first-page":"10224","DOI":"10.1109\/ACCESS.2019.2891065","volume":"7","author":"YH Wang","year":"2019","unstructured":"Wang YH, Cai SB, Lin CL et al (2019) Study of Blockchian\u2019s consensus mechanism based on credit. IEEE Access 7:10224\u201310231","journal-title":"IEEE Access"},{"key":"6122_CR18","doi-asserted-by":"crossref","unstructured":"Zhang ZJ, Zhu DL, Fan W (2021) \u201cQPBFT:practical Byzantine fault tolerance consensus algorithm based on quantified-role\u201d. In: Proceedings of IEEE 19th International Conference on Trust,Security and Privacy in Computing and Communications. Washington D. C. USA:IEEE Press, pp. 991-997","DOI":"10.1109\/TrustCom50675.2020.00132"},{"issue":"12","key":"6122_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","volume":"16","author":"S Gao","year":"2019","unstructured":"Gao S, Yu TY, Zhu JM et al (2019) T-PBFT:an EigenTrustbased practical Byzantine fault tolerance consensus algorithm. China Commun 16(12):111\u2013123","journal-title":"China Commun"},{"key":"6122_CR20","doi-asserted-by":"crossref","unstructured":"Yu G, Wu B, Niu X (2020) \u201cImproved blockchain consensus mechanism based on PBFT algorithm\u201d. In: 2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC). New Jersey: IEEE, pp. 14-21","DOI":"10.1109\/CTISC49998.2020.00009"},{"key":"6122_CR21","unstructured":"Xie JG, Li ZP, Jin J, et al New permissioned public blockchain based on master-sub chain architecture. Available online: http:\/\/kns.cnki.net\/kcms\/detail\/51.1307.TP.20220114.1821.008.html (accessed on 17 January 2022)"},{"key":"6122_CR22","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.future.2019.08.005","volume":"102","author":"EK Wang","year":"2020","unstructured":"Wang EK, Liang Z, Chen C, Kumari S, Khan MK (2020) PoRX: A reputation incentive scheme for blockchain consensus of IIoT. Future Gener Comput Syst 102:140\u2013151","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"6122_CR23","first-page":"1","volume":"9","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: Bringing order to the web. Stanford Digital Libraries Working Paper 9(1):1\u201314","journal-title":"Stanford Digital Libraries Working Paper"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06122-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T12:21:14Z","timestamp":1720441274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06122-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,3]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["6122"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06122-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,3]]},"assertion":[{"value":"1 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}