Optimal Contract Formulation for Mobile Edge Computing Task Offloading in Heterogeneous Networks Considering the Age of Information

Mobile edge computing (MEC) faces severe challenges in achieving efficient and timely task offloading in heterogeneous network environments. While existing contract-based approaches address incentive compatibility and resource coordination, many either ignore the constraints of age of information (AoI) or suffer from high computational complexity. This paper presents an AoI-guaranteed Optimal Contract (AOC) mechanism that jointly considers information freshness and asymmetric information in MEC systems. We design a three-tier heterogeneous network architecture with non-orthogonal multiple access to enable cooperative task offloading across multiple cells and enhance spectral efficiency. Instead of a model that requires extensive training and is difficult to analyze, our proposed AOC framework uses a lightweight block coordinate descent (BCD) algorithm to solve closed-form contract solutions while ensuring incentive compatibility and individual rationality. Simulation results show that the AOC mechanism significantly improves the utility and AoI performance of the MEC server compared with existing incentive-based methods. In addition, the analysis confirms the robustness and practical deployability of the proposed framework under different system conditions.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Information and Systems
Published
2025-05-27
DOI
https://doi.org/10.1587/transinf.2024edp7289
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Contract Formulation for Mobile Edge Computing Task Offloading in Heterogeneous Networks Considering the Age of Information

Zhiyao Sun, Peng Wang
1 links
IEICE Transactions on Information and Systems
Age of Information Optimization
article

Optimal Contract Formulation for Mobile Edge Computing Task Offloading in Heterogeneous Networks Considering the Age of Information

Zhiyao Sun, Peng Wang
article en

Abstract

Mobile edge computing (MEC) faces severe challenges in achieving efficient and timely task offloading in heterogeneous network environments. While existing contract-based approaches address incentive compatibility and resource coordination, many either ignore the constraints of age of information (AoI) or suffer from high computational complexity. This paper presents an AoI-guaranteed Optimal Contract (AOC) mechanism that jointly considers information freshness and asymmetric information in MEC systems. We design a three-tier heterogeneous network architecture with non-orthogonal multiple access to enable cooperative task offloading across multiple cells and enhance spectral efficiency. Instead of a model that requires extensive training and is difficult to analyze, our proposed AOC framework uses a lightweight block coordinate descent (BCD) algorithm to solve closed-form contract solutions while ensuring incentive compatibility and individual rationality. Simulation results show that the AOC mechanism significantly improves the utility and AoI performance of the MEC server compared with existing incentive-based methods. In addition, the analysis confirms the robustness and practical deployability of the proposed framework under different system conditions.

IEICE Transactions on Information and SystemsVol. E108.D(12)
Changchun University of Science and Technology (CN), Changchun University (CN)
Openalex Percentile: Top 88%
Age of Information Optimization
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.