Minimizing end-to-end delay in three-layer MEC with dual-input requirement

Most mobile edge computing (MEC) scenarios assume that all the input data of offloading tasks is transmitted from users. However, we notice that a more general situation, i.e., at least a part of input data, as common knowledge, should be provided from outside environments (e.g., the Internet). In this paper, we formulate the end-to-end delay in the High Altitude Platform Station (HAPS) and Roadside unit (RSU) assisted MEC, where the input data of these tasks are provided from both HAPS and users/nodes. Then we adopt the branch and bound method to relax this mixed-integer nonlinear programming (MINLP) problem. The Karush-Kuhn-Tucker (KKT) conditions and the interior-point method are utilized to analyze and optimize the relaxed problem. Experimental results show that our scheme can significantly reduce the end-to-end delay of data transmission and task offloading compared to other benchmark schemes.

Authors

Institutions

Publication Details

Published
2025-05-19
DOI
https://doi.org/10.1117/12.3068439
Primary Topic
Advancements in Semiconductor Devices and Circuit Design
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimizing end-to-end delay in three-layer MEC with dual-input requirement

meiling wang, Yang Gao, Yueming Fan, qingqun lian
Advancements in Semiconductor Devices and Circuit Design
article

Minimizing end-to-end delay in three-layer MEC with dual-input requirement

meiling wang, Yang Gao, Yueming Fan, qingqun lian
article en

Abstract

Most mobile edge computing (MEC) scenarios assume that all the input data of offloading tasks is transmitted from users. However, we notice that a more general situation, i.e., at least a part of input data, as common knowledge, should be provided from outside environments (e.g., the Internet). In this paper, we formulate the end-to-end delay in the High Altitude Platform Station (HAPS) and Roadside unit (RSU) assisted MEC, where the input data of these tasks are provided from both HAPS and users/nodes. Then we adopt the branch and bound method to relax this mixed-integer nonlinear programming (MINLP) problem. The Karush-Kuhn-Tucker (KKT) conditions and the interior-point method are utilized to analyze and optimize the relaxed problem. Experimental results show that our scheme can significantly reduce the end-to-end delay of data transmission and task offloading compared to other benchmark schemes.

Hainan University (CN), ZTE (China) (CN)
Openalex Percentile: Top 91%
Advancements in Semiconductor Devices and Circuit Design
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.

Minimizing end-to-end delay in three-layer MEC with dual-input requirement — meiling wang, Yang Gao, et al. · (2025) | TGRS Research Map | TGRS