Task-Offload-Oriented Resource Optimization in MEC-Enabled System with Multiple BSs

In the extensive research on next-generation communication network architectures, task offloading and resource allocation problems become increasingly complex for mobile edge computing (MEC) systems with multiple base stations (BSs). This paper first formulates this multi-dimensional dynamic issue as an optimization problem. To minimize system overhead, we propose an attention-based multi-agent proximal policy optimization (A-MAPPO) algorithm. This algorithm employs a centralized training and decentralized execution (CTDE) framework, and leverages attention mechanisms to facilitate the convergence of the critic network, thereby enhancing the algorithm's performance. Experimental results show that the A-MAPPO algorithm can reduce system costs by up to 28.3% compared to other benchmark algorithms.

Authors

Institutions

Publication Details

Published
2024-09-21
DOI
https://doi.org/10.1109/icicsp62589.2024.10809093
Citations
1
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Task-Offload-Oriented Resource Optimization in MEC-Enabled System with Multiple BSs

Yanzan Sun, Shunqing Zhang, Yong Fang, Chang Wang et al.
1 citations
Distributed and Parallel Computing Systems
0.35
article

Task-Offload-Oriented Resource Optimization in MEC-Enabled System with Multiple BSs

Yanzan Sun, Shunqing Zhang, Yong Fang, Chang Wang, Xiaojing Chen
article en
1 citations

Abstract

In the extensive research on next-generation communication network architectures, task offloading and resource allocation problems become increasingly complex for mobile edge computing (MEC) systems with multiple base stations (BSs). This paper first formulates this multi-dimensional dynamic issue as an optimization problem. To minimize system overhead, we propose an attention-based multi-agent proximal policy optimization (A-MAPPO) algorithm. This algorithm employs a centralized training and decentralized execution (CTDE) framework, and leverages attention mechanisms to facilitate the convergence of the critic network, thereby enhancing the algorithm's performance. Experimental results show that the A-MAPPO algorithm can reduce system costs by up to 28.3% compared to other benchmark algorithms.

Shanghai University (CN)
National Key Research and Development Program of China
Decent work and economic growth
Openalex Percentile: Top 35%
Distributed and Parallel Computing Systems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.