MétaCan
Menu
Back to cohort
Record W4414079421 · doi:10.1109/twc.2025.3604004

Online Hierarchical Computation Offloading for Marine IoT Networks: A Delay Minimization Approach

2025· article· en· W4414079421 on OpenAlexaff
Mingqing Li, Liping Qian, Fang Fang, Xianbin Wang

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2025
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsWestern University
FundersNational Natural Science Foundation of China
KeywordsComputation offloadingMobile edge computingWirelessWireless networkComputationEdge computingEnhanced Data Rates for GSM EvolutionConvex optimizationResource allocationOptimization problem

Abstract

fetched live from OpenAlex

Mobile edge computing (MEC) has emerged as a promising technology for marine Internet of Things (IoT) networks, supporting diverse application requirements that could be both computationally intensive and delay-sensitive. However, most existing studies assume access to pre-existing network information and rely on single-layer MEC frameworks to provide services from an offline perspective, struggling to ensure low latency. To overcome the related issues, we first consider an online hierarchical computation offloading framework in this paper for marine IoT networks with aerial, offshore, and onshore devices. We further develop a hybrid transmission strategy combining non-orthogonal multiple access (NOMA) and frequency division multiple access (FDMA) to enhance the computation offloading efficiency within the framework. Considering the time-varying capacity of wireless channels, we thus minimize the hierarchical computation offloading delay by jointly optimizing the offloading strategy and network resource allocation in the marine IoT networks online. To solve the formulated mixed-integer nonlinear programming (MINLP) problem, we design a problem-solving framework based on a decomposition structure. Specifically, we decompose the formulated MINLP problem into two subproblems. For the bottom subproblem, we design a successive convex approximation (SCA)-based algorithm to optimize the hierarchical transmission durations and the offloaded workload with a given user association scheme. For the top subproblem, we propose a deep reinforcement learning (DRL)-based algorithm to realize online optimization of the user association scheme under the time-varying channels. Finally, numerical results demonstrate that the proposed algorithms, including the SCA-based algorithm and the DRL-based algorithm, can reach near-optimal results. Furthermore, the proposed hierarchical computation offloading framework significantly outperforms traditional benchmarks.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.032
GPT teacher head0.291
Teacher spread0.260 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicIoT and Edge/Fog ComputingFrench-language works237,207