Learning While Offloading: Task Offloading in Vehicular Edge Computing Network

  • Liang Xiao
  • Weihua Zhuang
  • Sheng Zhou
  • Cailian Chen
Part of the Wireless Networks book series (WN)


In vehicular edge computing (VEC) systems, vehicles can contribute their computing resources to the network, and help other vehicles or pedestrians to process their computation tasks. However, the high mobility of vehicles leads to a dynamic and uncertain vehicular environment, where the network topologies, channel states and computing workloads vary fast across time. Therefore, it is challenging to design task offloading algorithms to optimize the delay performance of tasks. In this chapter, we consider the task offloading among vehicles, and design learning-based task offloading algorithms based on the multi-armed bandit (MAB) theory, which enable vehicles to learn the delay performance of their surrounding vehicles while offloading tasks. We start from the single offloading case where each task is offloaded to one vehicle to be processed, and propose an adaptive learning-based task offloading (ALTO) algorithm, by jointly considering the variations of surrounding vehicles and the input data size. To further improve the reliability of the computing services, we introduce the task replication technique, where the replicas of each task is offloaded to multiple vehicles and processed by them simultaneously, and propose a learning-based task replication algorithm (LTRA) based on combinatorial MAB. We prove that the proposed ALTO and LTRA algorithms have bounded learning regret, compared with the genie-aided optimal solution. And we also build a system level simulation platform to evaluate the proposed algorithms in the realistic vehicular environment.


  1. 1.
    J. S. Choo, M. Kim, S. Pack, and G. Dan, “The software-defined vehicular cloud: A new level of sharing the road,” IEEE Veh. Technol. Mag., vol. 12, no. 2, pp. 78–88, Jun. 2017.CrossRefGoogle Scholar
  2. 2.
    N. Lu, N. Cheng, N. Zhang, X. Shen, and J. W. Mark, “Connected Vehicles: Solutions and Challenges,” IEEE Internet Things J., vol. 1, no. 4, pp. 289–299, Aug. 2014.Google Scholar
  3. 3.
    M. Sookhak, F. R. Yu, Y. He, H. Talebian, N. Safa, N. Zhao, M. Khan, and N. Kumar, “Fog Vehicular Computing: Augmentation of Fog Computing Using Vehicular Cloud Computing,” IEEE Veh. Technol. Mag., vol. 12, no. 3, pp. 55–64, Sept. 2017.Google Scholar
  4. 4.
    C. Huang, R. Lu, and K. K. R. Choo, “Vehicular Fog Computing: Architecture, Use Case, and Security and Forensic Challenges,” IEEE Commun. Mag., vol. 55, no. 11, pp. 105–111, Nov. 2017.CrossRefGoogle Scholar
  5. 5.
    3GPP, “Study on enhancement of 3GPP support for 5G V2X services,” 3GPP TR 22.886, V15.1.0, Mar. 2017.Google Scholar
  6. 6.
    Y. Sun, X. Guo, S. Zhou, Z. Jiang, X. Liu, and Z. Niu, “Learning-based task offloading for vehicular cloud computing systems,” in Proc. IEEE Int. Conf. Commun. (ICC), Kansas City, MO, USA, May 2018.Google Scholar
  7. 7.
    J. B. Kenney, “Dedicated short-range communications (DSRC) standards in the United States,” Proceedings of the IEEE, vol. 99, no. 7, pp. 1162–1182, Jul. 2011.Google Scholar
  8. 8.
    Y. Mao, C. You, J. Zhang, K. Huang, and K. B. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE Commun. Surveys Tuts., vol. 19, no. 4, pp. 2322–2358, 2017.CrossRefGoogle Scholar
  9. 9.
    P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Machine learning, vol. 47, no. 2–3, pp. 235–256, 2002.CrossRefGoogle Scholar
  10. 10.
    Z. Bnaya, R. Puzis, R. Stern, and A. Felner, “Social network search as a volatile multi-armed bandit problem,” HUMAN, vol. 2, no. 2, pp. 84–98,Google Scholar
  11. 11.
    H. Wu, X. Guo, and X. Liu, “Adaptive exploration-exploitation tradeoff for opportunistic bandits.” International Conference on Machine Learning (ICML), Stockholm, Sweden, Jul. 2018.Google Scholar
  12. 12.
    M. Abdulla, E. Steinmetz, and H. Wymeersch,“Vehicle-to-vehicle communications with urban intersection path loss models,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Washington, DC, USA, Dec. 2016.Google Scholar
  13. 13.
    Y. Sun, J. Song, S. Zhou, X. Guo, and Z. Niu, “Task replication for vehicular edge computing: A combinatorial multi-armed bandit based approach,” IEEE Global Commun. Conf. (GLOBECOM), Abu Dhabi, UAE, Dec. 2018.Google Scholar
  14. 14.
    W. Chen, Y. Wang, and Y. Yuan. “Combinatorial multi-armed bandit: General framework and applications,” Int. Conf. on Machine Learning (ICML), Atlanta, GA, USA, Jun. 2013.Google Scholar
  15. 15.
    W. Chen, W. Hu, F. Li, J. Li, Y. Liu, and P. Lu, “Combinatorial multi-armed bandit with general reward functions,” Advances in Neural Information Processing Systems, vol. 29, 2016.Google Scholar
  16. 16.
    A. Goel, S. Guha, and K. Munagala, “How to probe for an extreme value,” ACM Trans. on Algorithms, vol. 7, no. 1, Nov. 2010.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Liang Xiao
    • 1
  • Weihua Zhuang
    • 2
  • Sheng Zhou
    • 3
  • Cailian Chen
    • 4
  1. 1.Department of Communication EngineeringXiamen UniversityXiamenChina
  2. 2.Department of Electrical & Computer EngineeringUniversity of WaterlooWaterlooCanada
  3. 3.Department of Electronic EngineeringTsinghua UniversityBeijingChina
  4. 4.Department of AutomationShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations