Evidence map›Paper›PMID 40210938›Full record

ArticleScientific reports2025

D2D assisted cooperative computational offloading strategy in edge cloud computing networks.

Yanyan Wang, Dechuan Kong, Haojie Chai, Hongzhou Qiu, Ran Xue, Shuhang Li

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Yanyan WangSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China.
Dechuan KongSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China.
Haojie ChaiSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China. nefuchj@163.com.
Hongzhou QiuSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China.
Ran XueSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China.
Shuhang LiSchool of Artificial Intelligence, Henan Institute of Science and Technology, Xinxiang, 453003, China.

Funding

National College Students' Innovative Training Program 202410467035Science and Technology Project of Henan Province 242102210050Science and Technology Project of Henan Province 252102210114
6 · The paper itself

Abstract

In the computational offloading problem of edge cloud computing (ECC), almost all researches develop the offloading strategy by optimizing the user cost, but most of them only consider the delay and energy consumption, and seldom consider the task waiting delay. This is very unfavorable for tasks with high sensitive latency requirements in the current era of intelligence. In this paper, by using D2D (Device-to-Device) technology, we propose a D2D-assisted collaboration computational offloading strategy (D-CCO) based on user cost optimization to obtain the offloading decision and the number of tasks that can be offloaded. Specifically, we first build a task queue system with multiple local devices, peer devices and edge processors, and compare the execution performance of computing tasks on different devices, taking into account user costs such as task delay, power consumption, and wait delay. Then, the stochastic optimization algorithm and the back-pressure algorithm are used to develop the offloading strategy, which ensures the stability of the system and reduces the computing cost to the greatest extent, so as to obtain the optimal offloading decision. In addition, the stability of the proposed algorithm is analyzed theoretically, that is, the upper bounds of all queues in the system are derived. The simulation results show the stability of the proposed algorithm, and demonstrate that the D-CCO algorithm is superior to other alternatives. Compared with other algorithms, this algorithm can effectively reduce the user cost.

Identifiers

PMID40210938
PMCPMC11986101

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.