The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Traffic and Computation Co-Offloading With Reinforcement Learning in Fog Computing for Industrial Applications
Abstract
In the past decade, network data communication has experienced a rapid growth, which has led to explosive congestion in heterogeneous networks. Moreover, the emerging industrial applications, such as automatic driving put forward higher requirements on both networks and devices. On the contrary, running computation-intensive industrial applications locally are constrained by the limited resources of devices. Correspondingly, fog computing has recently emerged to reduce the congestion of content-centric networks. It has proven to be a good way in industry and traffic for reducing network delay and processing time. In addition, device-to-device offloading is viewed as a promising paradigm to transmit network data in mobile environment, especially for autodriving vehicles. In this paper, jointly taking both the network traffic and computation workload of industrial traffic into consideration, we explore a fundamental tradeoff between energy consumption and service delay when provisioning mobile services in vehicular networks. In particular, when the available resource in mobile vehicles becomes a bottleneck, we propose a novel model to depict the users' willingness of contributing their resources to the public. We then formulate a cost minimization problem by exploiting the framework of Markov decision progress (MDP) and propose the dynamic reinforcement learning scheduling algorithm and the deep dynamic scheduling algorithm to solve the offloading decision problem. By adopting different mobile trajectory traces, we conduct extensive simulations to evaluate the performance of the proposed algorithms. The results show that our proposed algorithms outperform other benchmark schemes in the mobile edge networks.
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.
Integrity signals
Registry
Cites
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.
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
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353 · cited 1×
“Many existing studies focused on only a particular type of network or type of task [21], [22].”
Background
Cited by
Pham, Q.-V., Fang, F., Ha, V. N., Piran, M. J., Le, M., Le, L. B., Hwang, W.-J., & Ding, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3001277 · Cited by 870
Xu, Y., Gui, G., Gacanin, H., & Adachi, F. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059896 · Cited by 648
Edge Computing with Artificial Intelligence: A Machine Learning Perspective
Hua, H., Li, Y., Wang, T., Dong, N., Li, W., & Cao, J. (2023) · ACM Computing Surveys · doi:10.1145/3555802 · Cited by 563
Joint Task Offloading and Resource Allocation for Energy-Constrained Mobile Edge Computing
Jiang, H., Dai, X., Xiao, Z., & Iyengar, A. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3150432 · Cited by 411
Lu, Y., Huang, X., Dai, Y., Maharjan, S., & Zhang, Y. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2942179 · Cited by 387
Metadata
- Authors
- Wang, Y., Wang, K., Huang, H., Miyazaki, T., & Guo, S.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2019-02
- Volume
- 15
- Issue
- 2
- Pages
- 976-986
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2903362341
- Cited by
- 213
- References
- 1
- FWCI
- 18.21
- 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: Traffic and Computation Co-Offloading With Reinforcement Learning in Fog Computing for Industrial Applications. https://app.cochat.ai/papers/10.1109/tii.2018.2883991
- The paper
- Wang, Y., Wang, K., Huang, H., Miyazaki, T., & Guo, S. (2019). Traffic and Computation Co-Offloading With Reinforcement Learning in Fog Computing for Industrial Applications. IEEE Transactions on Industrial Informatics. https://doi.org/10.1109/tii.2018.2883991
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.