The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Folo: Latency and Quality Optimized Task Allocation in Vehicular Fog Computing
Open accessAbstract
With the emerging vehicular applications, such as real-time situational awareness and cooperative lane change, there exist huge demands for sufficient computing resources at the edge to conduct time-critical and data-intensive tasks. This paper proposes Folo, a novel solution for latency and quality optimized task allocation in vehicular fog computing (VFC). Folo is designed to support the mobility of vehicles, including vehicles that generate tasks and the others that serve as fog nodes. Considering constraints on service latency, quality loss, and fog capacity, the process of task allocation across stationary and mobile fog nodes is formulated into a joint optimization problem. This task allocation in VFC is known as a nondeterministic polynomial-time hard problem. In this paper, we present the task allocation to fog nodes as a bi-objective minimization problem, where a tradeoff is maintained between the service latency and quality loss. Specifically, we propose an event-triggered dynamic task allocation framework using linear programming-based optimization and binary particle swarm optimization. To assess the effectiveness of Folo, we simulated the mobility of fog nodes at different times of a day based on real-world taxi traces and implemented two representative tasks, including video streaming and real-time object recognition. Simulation results show that the task allocation provided by Folo can be adjusted according to actual requirements of the service latency and quality, and achieves higher performance compared with naive and random fog node selection. To be more specific, Folo shortens the average service latency by up to 27% while reducing the quality loss by up to 56%.
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
Fog computing and its role in the internet of things
Bonomi, F., Milito, R., Zhu, J., & Addepalli, S. (2012) · Proceedings of the first edition of the MCC workshop on Mobile cloud computing · doi:10.1145/2342509.2342513 · Cited by 6,244
Cited by
Reliable Computation Offloading for Edge-Computing-Enabled Software-Defined IoV
Hou, X., Ren, Z., Wang, J., Cheng, W., Ren, Y., Chen, K.-C., & Zhang, H. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2982292 · Cited by 334
Liu, L., Zhao, M., Yu, M., Jan, M. A., Lan, D., & Taherkordi, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3142566 · Cited by 303
Privacy-Preserving Aggregation for Federated Learning-Based Navigation in Vehicular Fog
Kong, Q., Yin, F., Lu, R., Li, B., Wang, X., Cui, S., & Zhang, P. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3075683 · Cited by 102
Jiang, X., Yu, F. R., Song, T., & Leung, V. C. M. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3065209 · Cited by 88
Leveraging 3GPP Features and Optimization Techniques for 5G NR-V2X Resource Allocation: A Survey
Bin Ali Wael, C., Hadj Dogheche, E., Armi, N., Subekti, A., & Dayoub, I. (2025) · IEEE Open Journal of Intelligent Transportation Systems · doi:10.1109/ojits.2025.3584024 · Cited by 10
“The study in [130] presents a dynamic task allocation called Folo.”
Metadata
- Authors
- Zhu, C., Tao, J., Pastor, G., Xiao, Y., Ji, Y., Zhou, Q., Li, Y., & Yla-Jaaski, A.
- Venue
- IEEE Internet of Things Journal
- Published
- 2019-06
- Volume
- 6
- Issue
- 3
- Pages
- 4150-4161
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W2897099070
- Cited by
- 219
- References
- 1
- FWCI
- 14.16
- Type
- journal article
- Language
- en
- Open access
- green
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.