TY - GEN
T1 - Minimizing Task Delay for Mobile Edge Generation in D2D Underlaying Cellular Network
AU - Zhang, Meng
AU - Zhong, Ruikang
AU - Zou, Yixuan
AU - Liu, Yue
AU - Shin, Hyundong
AU - Liu, Yuanwei
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - A mobile edge generation (MEG) framework is proposed for latency-sensitive tasks in social-aware D2D underlaying cellular networks. User devices (UDs) are organized into socially cohesive communities for cooperative generation via cellular and D2D links. A joint seed-and-content-based (JSCB) protocol is proposed to enable adaptive switching UD association between seed acquisition with local generation and direct content sharing, while a spillover mechanism is incorporated to handle overdue transmissions. An average task delay minimization problem is formulated to jointly optimize UD association, transmission mode, D2D pairing, and beamforming. To address the hybrid, temporally coupled problem, a joint matching and proximal policy optimization (JMPPO) algorithm is developed, in which discrete and continuous actions are decoupled through hierarchical deep reinforcement learning and matching. Numerical results demonstrate that JSCB achieves reduced delay via adaptive scheduling, while JMPPO outperforms learning-based and traditional baselines under diverse conditions.
AB - A mobile edge generation (MEG) framework is proposed for latency-sensitive tasks in social-aware D2D underlaying cellular networks. User devices (UDs) are organized into socially cohesive communities for cooperative generation via cellular and D2D links. A joint seed-and-content-based (JSCB) protocol is proposed to enable adaptive switching UD association between seed acquisition with local generation and direct content sharing, while a spillover mechanism is incorporated to handle overdue transmissions. An average task delay minimization problem is formulated to jointly optimize UD association, transmission mode, D2D pairing, and beamforming. To address the hybrid, temporally coupled problem, a joint matching and proximal policy optimization (JMPPO) algorithm is developed, in which discrete and continuous actions are decoupled through hierarchical deep reinforcement learning and matching. Numerical results demonstrate that JSCB achieves reduced delay via adaptive scheduling, while JMPPO outperforms learning-based and traditional baselines under diverse conditions.
UR - https://www.scopus.com/pages/publications/105045386518
U2 - 10.1109/ICC59461.2026.11587259
DO - 10.1109/ICC59461.2026.11587259
M3 - Conference contribution
AN - SCOPUS:105045386518
T3 - IEEE International Conference on Communications
BT - ICC 2026 - IEEE International Conference on Communications, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2026 IEEE International Conference on Communications, ICC 2026
Y2 - 24 May 2026 through 28 May 2026
ER -