Max-Min Computation Optimization in Multi-BS WPT-MEC Networks via Multi-Agent Reinforcement Learning
IEEE Transactions on Mobile Computing · 2026-05 · 25 (5) · 6596-6613
DOI: 10.1109/tmc.2025.3637266 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2026-05. Verfasst von Bincheng Zhu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Wireless power transfer enhanced mobile edge computing (WPT-MEC) has emerged as a key technology to support low-latency and energy-efficient computation in wireless networks. With increasing network density, multi-base-station architectures emerge where wireless devices (WDs) offload tasks to distributed base stations (BSs), creating challenges in maintaining quality-of-service fairness during complex resource coordination in multi-BS WPT-MEC networks. To address these challenges, we investigate a non-orthogonal multiple access (NOMA)-enhanced WPT-MEC network comprising multiple WDs and BSs with finite computational capacities. For ensuring fairness, we formulate a max-min problem to maximize the minimum task computation amount by jointly optimizing offloading decisions, NOMA decoding orders, offloading powers and time resource allocation, which results in a challenging mixed integer, sequence and nonlinear programming (MISNLP). To tackle this problem, we propose a two-stage distributed multi-agent algorithm. In the first stage, each BS agent generates offloading preferences based on partial observations, guiding WDs’ offloading decisions. In the second stage, given these offloading decisions, we develop an efficient convex-based algorithm to solve the per-BS resource allocation subproblem, jointly optimizing NOMA decoding order, offloading powers and time resource allocation. For effective training, we leverage off-policy training and the centralized training with decentralized execution (CTDE) paradigm with two key innovations: (1) a convex-based critic that evaluates the joint action without bias, and (2) a counterfactual baseline that isolates individual agent credit assignment. The proposed C3MA algorithm achieves six times faster convergence and at least 20% performance improvement when serving more than 20 WDs, compared with existing multi-agent schemes, while maintaining a near-optimal Jain’s fairness index of 0.97. Moreover, it sustains an ultra-low execution delay below 5 milliseconds even with 40 WDs, confirming its efficiency and scalability.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhu, B., Zhu, S., Chi, K., Mumtaz, S., & Bazzi, W. (2026). Max-Min Computation Optimization in Multi-BS WPT-MEC Networks via Multi-Agent Reinforcement Learning. IEEE Transactions on Mobile Computing, 25(5), 6596-6613. https://doi.org/10.1109/tmc.2025.3637266
Vancouver
Zhu B, Zhu S, Chi K, Mumtaz S, Bazzi W. Max-Min Computation Optimization in Multi-BS WPT-MEC Networks via Multi-Agent Reinforcement Learning. IEEE Transactions on Mobile Computing. 2026;25(5):6596-6613. doi:10.1109/tmc.2025.3637266
BibTeX
@article{Zhu2026,
author = {Zhu, Bincheng and Zhu, Shaojun and Chi, Kaikai and Mumtaz, Shahid and Bazzi, Wael},
title = {Max-Min Computation Optimization in Multi-BS WPT-MEC Networks via Multi-Agent Reinforcement Learning},
journal = {IEEE Transactions on Mobile Computing},
year = {2026},
volume = {25},
number = {5},
pages = {6596--6613},
doi = {10.1109/tmc.2025.3637266}
}
EUVIMED