MDP-Based Task Offloading for Vehicular Edge Computing Under Certain and Uncertain Transition Probabilities
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Low latency/delay is one of the most critical requirements for the application of vehicular networks. However, frequent real-time information update caused by vehicles high mobility is liable to aggravate the delay. Meanwhile, the task migration between different vehicular edge computing (VEC) servers results in an amount of delay if the computing cannot be completed before the vehicle moves out of the coverage of the current VEC server. In this paper, the problem is concluded as when and to whom to offload the task for VEC, which is formulated as a finite horizon Markov decision process (MDP) to minimize the delay with respect to the communication, computing, handover and migration. Through characterizing the time-space correlation of vehicles mobility, the curse of dimensionality problem in MDP is resolved. Meanwhile, a general expression of the transition probabilities is derived. On this basis, the specific results of highway, 2-D street and real-data scenarios are provided as well. For practical implementation considerations, the transition probabilities are commonly uncertain primarily due to random driver behavior, inaccurate sample data and complex path environment. Under this uncertain environment,a robust time-aware MDP-based task offloading algorithm (RTMDP) is proposed, which has been proved to perform well even under the high uncertain transition probabilities by simulation results.
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
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 2×
“The initial progress ofMECfrom the communication perspective are summarized in [4], where the task computation models and task offloading policies are discussed in details.”
BackgroundSelf-citationDynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705 · cited 1×
“In [7], [8], Lyapunov optimization is developed to optimize the time-averaged throughput and energy”
MethodSelf-citationChen, X., Zhang, H., Wu, C., Mao, S., Ji, Y., & Bennis, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2876279 · Cited by 680
Optimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760186 · Cited by 251 · cited 1×
“In [7], [8], Lyapunov optimization is developed to optimize the time-averaged throughput and energy consumption under the assumption that random variables are independent and identically distributed (i.i.d.) over slots, which can be solved by greedily minimizing a drift plus penalty expression.”
Cited by
Federated Learning for Vehicular Internet of Things: Recent Advances and Open Issues
Du, Z., Wu, C., Yoshinaga, T., Yau, K.-L. A., Ji, Y., & Li, J. (2020) · IEEE Open Journal of the Computer Society · doi:10.1109/ojcs.2020.2992630 · Cited by 393
“[101] discuss task migration problem with a consideration of offloading delay, and formulates the problem as a finite horizon Markov decision process.”
BackgroundPrivacy-Preserved Federated Learning for Autonomous Driving
Li, Y., Tao, X., Zhang, X., Liu, J., & Xu, J. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3081560 · Cited by 259
Self-citationTask Offloading With Multi-Tier Computing Resources in Next Generation Wireless Networks
Wang, K., Jin, J., Yang, Y., Zhang, T., Nallanathan, A., Tellambura, C., & Jabbari, B. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3227102 · Cited by 95
“There exists extensive literature in online learning task offloading for stochastic optimization, such as DRL [109]–[112], which generally target at a broader set of learning problems in MDPs.”
BackgroundRen, Y., Chen, X., Guo, S., Guo, S., & Xiong, A. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3092346 · Cited by 74
Bao, W., Wu, C., Guleng, S., Zhang, J., Yau, K.-L. A., & Ji, Y. (2021) · China Communications · doi:10.23919/jcc.2021.06.004 · Cited by 71
Self-citation
Metadata
- Authors
- Zhang, X., Zhang, J., Liu, Z., Cui, Q., Tao, X., & Wang, S.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2020-03
- Volume
- 69
- Issue
- 3
- Pages
- 3296-3309
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W3000652959
- Cited by
- 119
- References
- 5
- FWCI
- 9.19
- 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: MDP-Based Task Offloading for Vehicular Edge Computing Under Certain and Uncertain Transition Probabilities. https://app.cochat.ai/papers/10.1109/tvt.2020.2965159
- The paper
- Zhang, X., Zhang, J., Liu, Z., Cui, Q., Tao, X., & Wang, S. (2020). MDP-Based Task Offloading for Vehicular Edge Computing Under Certain and Uncertain Transition Probabilities. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2020.2965159
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.