TY - JOUR
T1 - A Two-Layer Framework for Edge Node Cooperation and Resource Sharing in Multi-Access Edge Computing Systems
AU - Meng, Anqi
AU - Huang, Yuting
AU - Gao, Xiaozheng
AU - Xu, Zhan
AU - Shi, Minwei
AU - Kang, Jiawen
AU - Han, Zhu
N1 - Publisher Copyright:
© 1972-2012 IEEE.
PY - 2026
Y1 - 2026
N2 - With the growing demand for computation-intensive applications, multi-access edge computing (MEC) has emerged as a critical paradigm that decentralizes computation and storage by bringing resources closer to users. As distributed computing undergoes ongoing development propelled by the advancements in the Internet of Things (IoT) and mobile communication technologies, the issue of edge node cooperation and resource sharing needs to be investigated. In this paper, the issue of edge node cooperation and resource sharing is modeled as a two-layer framework. More specifically, in the lower layer, a heuristic matching algorithm between users and edge nodes is developed, and a resource sharing algorithm among edge nodes in the same coalition is proposed. In the upper layer, a centralized coalition formation algorithm is designed based on the Hungarian method, and then we further define the coalition rules among edge nodes and propose a distributed coalition formation algorithm. Simulation results demonstrate that the proposed algorithms reduce the network cost effectively compared with non-cooperative schemes. Moreover, we analyze the impact of various network parameters on the network cost, thereby providing insights for future optimization and development in MEC networks.
AB - With the growing demand for computation-intensive applications, multi-access edge computing (MEC) has emerged as a critical paradigm that decentralizes computation and storage by bringing resources closer to users. As distributed computing undergoes ongoing development propelled by the advancements in the Internet of Things (IoT) and mobile communication technologies, the issue of edge node cooperation and resource sharing needs to be investigated. In this paper, the issue of edge node cooperation and resource sharing is modeled as a two-layer framework. More specifically, in the lower layer, a heuristic matching algorithm between users and edge nodes is developed, and a resource sharing algorithm among edge nodes in the same coalition is proposed. In the upper layer, a centralized coalition formation algorithm is designed based on the Hungarian method, and then we further define the coalition rules among edge nodes and propose a distributed coalition formation algorithm. Simulation results demonstrate that the proposed algorithms reduce the network cost effectively compared with non-cooperative schemes. Moreover, we analyze the impact of various network parameters on the network cost, thereby providing insights for future optimization and development in MEC networks.
KW - Multi-access edge computing
KW - coalition game
KW - resource sharing
UR - https://www.scopus.com/pages/publications/105032702887
U2 - 10.1109/TCOMM.2026.3672177
DO - 10.1109/TCOMM.2026.3672177
M3 - Article
AN - SCOPUS:105032702887
SN - 1558-0857
VL - 74
SP - 5930
EP - 5943
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
ER -