Yi Li , Jinsong Wang , Hongwei Zhang , Zening Zhao , Yuemin Ding
{"title":"AssociateChain: Scaling blockchain in cloud–edge-enabled Metaverse via associative sharding","authors":"Yi Li , Jinsong Wang , Hongwei Zhang , Zening Zhao , Yuemin Ding","doi":"10.1016/j.comcom.2025.108150","DOIUrl":null,"url":null,"abstract":"<div><div>Blockchain has been extensively employed to strengthen the security and privacy of cloud–edge-enabled Metaverse due to its immutability, decentralization, and other key characteristics. However, limited scalability remains a significant barrier to its broader adoption. Sharding offers a promising solution for scaling blockchain, but existing schemes perform state and node sharding separately, ignoring the fact that, in cloud–edge computing, end devices are typically serviced by the nearest edge nodes to achieve a high quality of service (QoS). We define this characteristic as device–edge proximity. As a result, device states may be assigned to distant edge node shards, requiring transactions to be relayed over the wide-area network before reaching their assigned shards, thus introducing additional relay overhead and increasing the overall transaction latency. To address this challenge, we propose AssociateChain, which employs a two-stage associative sharding approach to minimize number of relay transactions. In the first stage, device states are grouped into shards based on historical transaction patterns. In the second stage, the edge node sharding process is modeled as a stable matching problem, optimizing the assignment of edge nodes based on the first-stage results and device–edge proximity. Furthermore, we introduce a double-check mechanism to strengthen resilience against potential takeover attacks. Although AssociateChain slightly increases sharding complexity from <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> to <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>k</mi><mrow><mo>(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span>, where n is the number of nodes and k is the number of shards, experiments demonstrate that it reduces the relay transaction ratio by 90%, lowers relay delay by two orders of magnitude, and decreases total cost by 70%, significantly outperforming existing sharding schemes.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"237 ","pages":"Article 108150"},"PeriodicalIF":4.5000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425001070","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Blockchain has been extensively employed to strengthen the security and privacy of cloud–edge-enabled Metaverse due to its immutability, decentralization, and other key characteristics. However, limited scalability remains a significant barrier to its broader adoption. Sharding offers a promising solution for scaling blockchain, but existing schemes perform state and node sharding separately, ignoring the fact that, in cloud–edge computing, end devices are typically serviced by the nearest edge nodes to achieve a high quality of service (QoS). We define this characteristic as device–edge proximity. As a result, device states may be assigned to distant edge node shards, requiring transactions to be relayed over the wide-area network before reaching their assigned shards, thus introducing additional relay overhead and increasing the overall transaction latency. To address this challenge, we propose AssociateChain, which employs a two-stage associative sharding approach to minimize number of relay transactions. In the first stage, device states are grouped into shards based on historical transaction patterns. In the second stage, the edge node sharding process is modeled as a stable matching problem, optimizing the assignment of edge nodes based on the first-stage results and device–edge proximity. Furthermore, we introduce a double-check mechanism to strengthen resilience against potential takeover attacks. Although AssociateChain slightly increases sharding complexity from to , where n is the number of nodes and k is the number of shards, experiments demonstrate that it reduces the relay transaction ratio by 90%, lowers relay delay by two orders of magnitude, and decreases total cost by 70%, significantly outperforming existing sharding schemes.
期刊介绍:
Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms.
Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.