A task-driven offloading algorithm based on Balanced Multi-Agent Deep Deterministic Policy Gradient (BMADDPG) that reduces average task processing latency by approximately 22.67% and decreases total system cost by at least 18.32% under high-load scenarios.
Abstract
With the development of the Internet of Things and multi-access edge computing, latency-sensitive tasks impose higher requirements on network computing capability and service quality. Existing task offloading methods usually focus on a single performance metric and often adopt time-slot-driven decision mechanisms, which may introduce additional waiting latency and increase system cost. To address these problems, this paper proposes a task-driven offloading algorithm based on Balanced Multi-Agent Deep Deterministic Policy Gradient (BMADDPG). First, a four-layer integrated air–space–ground multi-access edge computing network model is constructed, consisting of ground devices, unmanned aerial vehicles (UAVs), low-Earth-orbit (LEO) satellites, and cloud servers. Multi-level computing node collaboration is used to improve the system computing capability. Second, the task offloading process is modeled as a multi-agent Markov decision process, where ground user devices act as agents. A centralized Critic and distributed Actor structure is adopted for collaborative decision-making. The proposed algorithm uses DDPG to handle continuous action spaces and triggers offloading decisions immediately upon task arrival, thereby avoiding time-slot waiting overhead. Meanwhile, latency, energy consumption, and load balancing constraints are incorporated into the reward function to guide global resource allocation. Simulation results show that BMADDPG converges stably within about 800 training episodes. Compared with DDPG, DQN, PPO, and D3QN, it reduces average task processing latency by approximately 22.67% and decreases total system cost by at least 18.32% under high-load scenarios.
A constraint-aware multi-agent edge collaborative offloading algorithm (CARE-CTDE) that achieves better scheduling performance, resource utilization, and constraint satisfaction than baseline methods in dynamic heterogeneous MEC scenarios, demonstrating its effectiveness and robustness for constrained edge computing sy...
Yuxuan Yang, Hexing Wang, Yang Zhou· Mathematics· 0 citations
This paper addresses the joint task offloading and resource allocation problem in multi-user MEC systems and proposes a decentralized control framework based on Multi-Agent Reinforcement Learning (MARL), which achieves lower total system cost and faster convergence than the full-local, full-offload, and heuristic basel...
Youssef Oukissou, Mohamed Amine Meddaoui, Ayoub Belaidi et al.· International journal of Com...· 0 citations
The rapid growth of Internet of Vehicles (IoV) applications has imposed strict requirements on low-latency and energy-efficient computing services. This letter investigates a multi-Uncrewed Aerial Vehicle (UAV)-assisted IoV system, where multiple Mobile Edge Computing (MEC)-enabled UAVs (MUs) collaboratively provide co...
Yong-Bin Wang, Peng Lin, Yan Liu et al.· IEEE Wireless Communications...· 0 citations
An adaptive Beta-policy and delayed-update multi-agent soft actor-critic method, abbreviated as ABDMASAC, which uses a Beta policy to model bounded actions and achieves a better overall trade-off than the selected MASAC-backbone and on-policy MARL baselines under the considered simulation settings.
Zheng Yao, Jie Liu, Changjun Deng et al.· Computers, Materials & C...· 0 citations
Integrated Terrestrial–Non-Terrestrial Networks (ITNTN), which combine terrestrial base stations (BSs), High-Altitude Platform Stations (HAPS), and Low-Earth Orbit (LEO) satellites, are key enablers of 6G communication and edge computing (EC) services. However, energy-limited BSs, particularly HAPS and satellites, pose...
Insaf Rzig, W. Jaafar, Safwan Alfattani· International Conference on...· 0 citations
Existing studies on unmanned aerial vehicle (UAV)-based Mobile Edge Computing (MEC) primarily focus on independent tasks that can be decomposed and executed in parallel. However, many practical applications involve interdependent tasks that are naturally modeled as directed acyclic graphs (DAGs). Although recent work h...
Ke Ma, Junfei Xie, Shangping Ren et al.· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.