Joint Optimization of Task Partial Offloading and Resource Allocation in a Dual-Blockchain-Enabled MEC System with Parallelism Constraints

Huang, Xiaowen, Huang, Tao, Zhao, Shuguang, Xiang, Wei, Zhang, Wenqian, and Zhang, Guanglin (2025) Joint Optimization of Task Partial Offloading and Resource Allocation in a Dual-Blockchain-Enabled MEC System with Parallelism Constraints. IEEE Transactions on Communications, 73 (12). pp. 13725-13740.

[img] PDF (Published Version) - Published Version
Restricted to Repository staff only

View at Publisher Website: https://doi.org/10.1109/TCOMM.2025.36101...


Abstract

Integrating data security with resource management enhances security, efficiency, and reliability of blockchain-enabled mobile edge computing (MEC) systems. However, challenges such as secure data storage, timely task execution, and limited parallelism introduce complexities in task offloading decisions and resource allocation strategies. To address these challenges, the task latency minimization problem in blockchain-enabled MEC networks is formulated as an NP-hard optimization problem. The model incorporates constraints on parallelism, partial task offloading, bandwidth and computation resource allocation among mobile users (MUs) and edge servers (ESs). To enhance the reliability and transparency of data storage, a dual-blockchain framework is proposed, consisting of multiple MU blockchains and a dedicated ES blockchain. To tackle the NP-hard problem, the original optimization problem is decomposed into multiple sub-problems, facilitating parameter decoupling. An alternating optimization algorithm is employed to refine task offloading decisions and resource allocation of MUs and ESs with limited parallelism. The ESs update their strategies iteratively based on feedback mechanisms. Additionally, a task prioritization formulation is developed to enhance scalability, considering sub-level task importance, urgency, and first-level task classification. Extensive simulation experiments demonstrate that the proposed algorithm achieves lower task latency compared to existing methods across varying network sizes, offloading schemes, and parallelism constraints. By optimizing the parallel processing of tasks, the waiting latency of this algorithm is reduced on average by 35. 35%, 57. 16% and 35. 35% compared to other methods, respectively.

Item ID: 89248
Item Type: Article (Research - C1)
ISSN: 1558-0857
Keywords: blockchain, Mobile edge computing, parallelism, task partial offloading
Copyright Information: © 2025 IEEE. All rights reserved, including rights for text and data mining, and training of artificial intelligence and similar technologies. Personal use is permitted, but republication/redistribution requires IEEE permission.
Date Deposited: 17 Jul 2026 06:13
FoR Codes: 46 INFORMATION AND COMPUTING SCIENCES > 4604 Cybersecurity and privacy > 460403 Data security and protection @ 100%
SEO Codes: 22 INFORMATION AND COMMUNICATION SERVICES > 2204 Information systems, technologies and services > 220405 Cybersecurity @ 100%
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page