MetaShard: A Novel Sharding Blockchain Platform for Metaverse Applications

被引:3
作者
Nguyen, Cong T. [1 ]
Hoang, Dinh Thai [1 ]
Nguyen, Diep N. [1 ]
Xiao, Yong [2 ,3 ,4 ]
Niyato, Dusit [5 ]
Dutkiewicz, Eryk [1 ]
机构
[1] Univ Technol Sydney, Sch Elect & Data Engn, Sydney, NSW 2007, Australia
[2] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Peoples R China
[3] Peng Cheng Lab, Shenzhen 518055, Peoples R China
[4] Pazhou Lab Huangpu, Guangzhou 510555, Peoples R China
[5] Nanyang Technol Univ, Singapore 639798, Singapore
关键词
Metaverse; Blockchains; Sharding; Security; Throughput; Scalability; Protocols; 51% attacks; blockchain; security; sharding; SCALING BLOCKCHAIN; SECURITY; FUNDAMENTALS; MANAGEMENT; SCHEME;
D O I
10.1109/TMC.2023.3290955
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to its security, transparency, and flexibility in verifying virtual assets, blockchain has been identified as one of the key technologies for Metaverse. Unfortunately, blockchain-based Metaverse faces serious challenges such as massive resource demands, scalability, and security/privacy concerns. To address these issues, this paper proposes a novel sharding-based blockchain framework, namely MetaShard, for Metaverse applications. Particularly, we first develop an effective consensus mechanism, namely Proof-of-Engagement, that can incentivize MUs' data and computing resource contribution. Moreover, to improve the scalability of MetaShard, we propose an innovative sharding management scheme to maximize the network's throughput while protecting the shards from 51% attacks. Since the optimization problem is NP-complete, we develop a hybrid approach that decomposes the problem (using the binary search method) into sub-problems that can be solved effectively by the Lagrangian method. As a result, the proposed approach can obtain solutions in polynomial time, thereby enabling flexible shard reconfiguration and reducing the risk of corruption from the adversary. Extensive numerical experiments show that, compared to the state-of-the-art commercial solvers, our proposed approach can achieve up to 66.6% higher throughput in less than 1/30 running time. Moreover, the proposed approach can achieve global optimal solutions in most experiments.
引用
收藏
页码:4348 / 4361
页数:14
相关论文
共 50 条
  • [1] Adidas, Impossible is (probably) nothing
  • [2] [Anonymous], Welcome to MetaSpace
  • [3] [Anonymous], 2023, What is SAND?
  • [4] [Anonymous], 2023, Jump in and be a part of meta horizon worlds
  • [5] [Anonymous], 2023, Welcome to Decentraland
  • [6] Beekhuizen C., 2020, Validated, staking on eth2: #3-sharding consensus
  • [7] Boyd S., 2011, CONVEX OPTIMIZATION
  • [8] A Sharding Scheme-Based Many-Objective Optimization Algorithm for Enhancing Security in Blockchain-Enabled Industrial Internet of Things
    Cai, Xingjuan
    Geng, Shaojin
    Zhang, Jingbo
    Wu, Di
    Cui, Zhihua
    Zhang, Wensheng
    Chen, Jinjun
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2021, 17 (11) : 7650 - 7658
  • [9] Compute- and Data-Intensive Networks: The Key to the Metaverse
    Cai, Yang
    Llorca, Jaime
    Tulino, Antonia M.
    Molisch, Andreas F.
    [J]. 2022 1ST INTERNATIONAL CONFERENCE ON 6G NETWORKING (6GNET), 2022,
  • [10] Benzene: Scaling Blockchain With Cooperation-Based Sharding
    Cai, Zhongteng
    Liang, Junyuan
    Chen, Wuhui
    Hong, Zicong
    Dai, Hong-Ning
    Zhang, Jianting
    Zheng, Zibin
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2023, 34 (02) : 639 - 654