The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Resource Allocation for Vehicular Fog Computing Using Reinforcement Learning Combined With Heuristic Information
Abstract
Internet of Vehicles (IoV) has emerged as a key component of smart cities. Connected vehicles are increasingly processing real-time data to respond immediately to user requests. However, the data must be sent to a remote cloud for processing. To resolve this issue, vehicular fog computing (VFC) has emerged as a promising paradigm that improves the quality of computation experiences for vehicles by offloading computation tasks from the cloud to network edges. Nevertheless, due to the resource restrictions of fog computing, only a limited number of vehicles are able to use it while it is still challenging to provide real-time responses for vehicular applications, such as traffic and accident warnings in the highly dynamic IoV environment. Therefore, in this article, we formulate the problem of allocating the limited fog resources to vehicular applications such that the service latency is minimized, by utilizing parked vehicles. We then propose a heuristic algorithm to efficiently find the solutions of the problem formulation. In addition, the proposed algorithm is combined with reinforcement learning to make more efficient resource allocation decisions, leveraging the vehicles' movement and parking status collected from the smart environment of the city. Our simulation results show that our VFC resource allocation algorithm can achieve higher service satisfaction compared to conventional resource allocation algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132 · cited 2×
“Previous RL studies [11], [24], [25] considered practical problems requiring only few numbers/types of actions (e.g., move left and right for the classic cart-pole problem), and sometimes their solution spaces are discrete or even Boolean.”
BackgroundFog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362
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×
“Mao et al. [28] employed the REINFORCE algorithm [36] for a resource allocation problem with a discrete action space.”
MethodMobile edge computing, Fog et al.: A survey and analysis of security threats and challenges
Roman, R., Lopez, J., & Mambo, M. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.009 · Cited by 1,338 · cited 1×
“The term “fog computing” was first created by Cisco back in 2012 while the edge computing was introduced by IBM and Nokia Siemens Network in 2013 [20].”
Methodpeng (2017) · doi:10.1145/3072959.3073602 · Cited by 502
Li, X., Fang, J., Cheng, W., Duan, H., Chen, Z., & Li, H. (2018) · IEEE Access · doi:10.1109/access.2018.2831240 · Cited by 192 · cited 1×
“Moreover, an RL-based power control algorithm was proposed for spectrum sharing [33].”
Method
Cited by
Zhang, K., Cao, J., & Zhang, Y. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3088407 · Cited by 330
Deep Reinforcement Learning for Internet of Things: A Comprehensive Survey
Chen, W., Qiu, X., Cai, T., Dai, H.-N., Zheng, Z., & Zhang, Y. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3073036 · Cited by 311
AI-based fog and edge computing: A systematic review, taxonomy and future directions
Iftikhar, S., Gill, S. S., Song, C., Xu, M., Aslanpour, M. S., Toosi, A. N., Du, J., Wu, H., Ghosh, S., Chowdhury, D., et al. (2023) · Internet of Things · doi:10.1016/j.iot.2022.100674 · Cited by 260
RADiT: Resource Allocation in Digital Twin-Driven UAV-Aided Internet of Vehicle Networks
Hazarika, B., Singh, K., Li, C.-P., Schmeink, A., & Tsang, K. F. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3310048 · Cited by 109
Alsadie, D. (2024) · IEEE Access · doi:10.1109/access.2024.3447097 · Cited by 81
Metadata
- Authors
- Lee, S.-S., & Lee, S.
- Venue
- IEEE Internet of Things Journal
- Published
- 2020-10
- Volume
- 7
- Issue
- 10
- Pages
- 10450-10464
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W3026449395
- Cited by
- 169
- References
- 8
- FWCI
- 11.43
- 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
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.