Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 200

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

An efficient task scheduling approach using moth‐flame optimization algorithm for cyber‐physical system applications in fog computing

Ghobaei‐Arani, Mostafa, Souri, Alireza, Safara, Fatemeh, Norouzi, Monire · 2020 · Transactions on Emerging Telecommunications Technologies

Abstract

With the rapid development of in modern technologies has led to a novel generation of cyberspace equipment and secure analysis methods such as cyber‐physical system (CPS). The CPS system refers to an intelligent dependable system of embedded smart devices used to monitor and control the cyberspace conditions in a fog computing environment. The fog computing environment connects resources even human beings together to enhance the quality of life through performing of CPS applications using computation resources at the network edge. The optimization of task scheduling for the CSP applications as a challenging issue has been considered as the NP‐hard problem in fog computing environment which is not trivial. On the one hand, reasonable tasks scheduling can increase resource utilization, which can avoid less idle resource. This paper presents a task scheduling algorithm based on moth‐flame optimization algorithm to assign an optimal set of tasks to fog nodes to meet the satisfaction of quality of service requirements of CPS applications in such a way that the total execution time of tasks is minimized. The minimization of task execution and transfer time in the proposed algorithm are considered as objective functions. The experimental testing of the proposed solution is carried out in iFogSim toolkit. As a result of the simulation based on proposed algorithm found, the optimal solution for the scheduling of tasks and equal distribution of tasks to fog nodes has been provided, and less total execution time consumption has been achieved compared with other algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/ett.3770

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 200

Metadata

Authors
Ghobaei‐Arani, M., Souri, A., Safara, F., & Norouzi, M.
Venue
Transactions on Emerging Telecommunications Technologies
Publisher
Wiley
Published
2019-10-23
Volume
31
Issue
2
ISSN
2161-3915 (ISSN-L)
OpenAlex
W2982054674
Cited by
200
References
3
FWCI
14.60
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An efficient task scheduling approach using moth‐flame optimization algorithm for cyber‐physical system applications in fog computing. https://app.cochat.ai/papers/10.1002/ett.3770
The paper
Ghobaei‐Arani, M., Souri, A., Safara, F., & Norouzi, M. (2020). An efficient task scheduling approach using moth‐flame optimization algorithm for cyber‐physical system applications in fog computing. Transactions on Emerging Telecommunications Technologies. https://doi.org/10.1002/ett.3770

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.