2021
DOI: 10.1016/j.matpr.2020.07.104
|View full text |Cite
|
Sign up to set email alerts
|

To optimize the multi accesses download time using scheduling approach in fog computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Self-Similarity-based clustering is implemented in [24] but fog computing contains heterogeneous systems similarity-based grouping is not suitable. K-means++ clustering-based grouping is used in [25] but the optimization of the algorithm is not verified. The optimized K-means clustering is implemented to make an effective clustering.…”
Section: Optimized K-means Elbow Clusteringmentioning
confidence: 99%
“…Self-Similarity-based clustering is implemented in [24] but fog computing contains heterogeneous systems similarity-based grouping is not suitable. K-means++ clustering-based grouping is used in [25] but the optimization of the algorithm is not verified. The optimized K-means clustering is implemented to make an effective clustering.…”
Section: Optimized K-means Elbow Clusteringmentioning
confidence: 99%
“…To achieve this goal, a heuristic algorithm was created, which lowered not only the cost of energy but also the time it took to complete the task. [20] suggested a fog scheduling strategy that took into account multiple access download times, lowering the average response time. [21] proposed an integrated iterative optimization on subcarrier that took into account power and trajectory to arrive at the best option.…”
Section: Work That Are Relatedmentioning
confidence: 99%