.png){kind=icon}
.png){kind=icon}
Return
Enhancing Data Processing Efficiency in Blockchain Enabled Metaverse Over Wireless Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2025.3581952.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the rapidly evolving landscape of the Metaverse, enhanced by blockchain technology, the efficient processing of data has emerged as a critical challenge, especially in wireless communication systems. Addressing this challenge, our paper introduces the innovative concept of data processing efficiency (DPE), aiming to maximize processed bits per unit of resource consumption in blockchain-empowered Metaverse environments. To achieve this, we propose the <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</u>PE-<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</u>ware <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</u>ser Association and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</u>esource Allocation (DAUR) algorithm, a tailored optimization framework for blockchain-enabled Metaverse wireless communication systems characterized by joint computing and communication resource constraints. The DAUR algorithm transforms the nonconvex problem of maximizing the sum of DPE ratios into a solvable convex optimization problem. It alternates the optimization of key variables, including user association, work offloading ratios, task-specific computing resource distribution, bandwidth allocation, user power usage ratios, and server computing resource allocation ratios. Our extensive numerical results demonstrate the DAUR algorithm’s effectiveness in DPE.
Keywords:
Blockchain
data processing efficiency
difference-of-convex programming
fractional programming
Metaverse
resource allocation
semidefinite relaxation
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W