2021
DOI: 10.1049/tje2.12040
|View full text |Cite
|
Sign up to set email alerts
|

A computing resource scheduling strategy of massive IoT devices in the mobile edge computing environment

Abstract: Aiming at the problem of scheduling computing resources for massive Internet of Things (IoT) devices, this paper proposes a scheduling strategy model based on mobile edge computing for massive IoT computing resources. First, the application scenarios are defined, the task offloading model and queue model are constructed. Then, task urgency and BS energy are considered to determine the optimization goal. Next, wolf colony algorithm is used to improve pheromone calculation so that the ant colony algorithm conver… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 28 publications
0
4
0
Order By: Relevance
“…The results of the path discovery from h1 to h2 using the DFS and the Dijkstra multipath algorithm, which are carried out five times, are presented in Tables 2 and 3. Based on five trials using the multipath DFS algorithm, a path was chosen with the smallest cost value in the 5th experiment with paths [13,6,2,3,11,20] and a cost of 1206.88. The alternative path was path [13,6,2,8,3,11,20] with a cost value of 1440.84, and path [13,6,2,9,3,11,20] with a cost value of 1444.02.…”
Section: A Path Discovery Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The results of the path discovery from h1 to h2 using the DFS and the Dijkstra multipath algorithm, which are carried out five times, are presented in Tables 2 and 3. Based on five trials using the multipath DFS algorithm, a path was chosen with the smallest cost value in the 5th experiment with paths [13,6,2,3,11,20] and a cost of 1206.88. The alternative path was path [13,6,2,8,3,11,20] with a cost value of 1440.84, and path [13,6,2,9,3,11,20] with a cost value of 1444.02.…”
Section: A Path Discovery Resultsmentioning
confidence: 99%
“…Based on five trials using the multipath DFS algorithm, a path was chosen with the smallest cost value in the 5th experiment with paths [13,6,2,3,11,20] and a cost of 1206.88. The alternative path was path [13,6,2,8,3,11,20] with a cost value of 1440.84, and path [13,6,2,9,3,11,20] with a cost value of 1444.02. Meanwhile, from five trials using the Dijkstra multipath algorithm, there was a path with the smallest cost value in the 4th experiment with path [13,6,2,3,11,20] and a cost value of 1263.05.…”
Section: A Path Discovery Resultsmentioning
confidence: 99%
See 2 more Smart Citations