Papers
Topics
Authors
Recent
Search
2000 character limit reached

Task Offloading Optimization in Mobile Edge Computing under Uncertain Processing Cycles and Intermittent Communications

Published 8 Sep 2023 in cs.NI and eess.SP | (2309.04204v2)

Abstract: Mobile edge computing (MEC) has been regarded as a promising approach to deal with explosive computation requirements by enabling cloud computing capabilities at the edge of networks. Existing models of MEC impose some strong assumptions on the known processing cycles and unintermittent communications. However, practical MEC systems are constrained by various uncertainties and intermittent communications, rendering these assumptions impractical. In view of this, we investigate how to schedule task offloading in MEC systems with uncertainties. First, we derive a closed-form expression of the average offloading success probability in a device-to-device (D2D) assisted MEC system with uncertain computation processing cycles and intermittent communications. Then, we formulate a task offloading maximization problem (TOMP), and prove that the problem is NP-hard. For problem solving, if the problem instance exhibits a symmetric structure, we propose a task scheduling algorithm based on dynamic programming (TSDP). By solving this problem instance, we derive a bound to benchmark sub-optimal algorithm. For general scenarios, by reformulating the problem, we propose a repeated matching algorithm (RMA). Finally, in performance evaluations, we validate the accuracy of the closed-form expression of the average offloading success probability by Monte Carlo simulations, as well as the effectiveness of the proposed algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. F. Bonomi, R. Milito, J. Zhu, and S. Addepalli, “Fog computing and its role in the internet of things,” in Proc. 1st Ed. MCC Workshop mobile cloud computing, Helsinki, Finland, 2012, pp. 13–16.
  2. D. Xu, Y. Li, X. Chen, J. Li, P. Hui, S. Chen, and J. Crowcroft, “A survey of opportunistic offloading,” IEEE Commun. Surv. Tutor., vol. 20, no. 3, pp. 2198–2235, 2018.
  3. M. Waqas, Y. Niu, Y. Li, et al, “A comprehensive survey on mobility-aware D2D communications: Principles, practice and challenges,” IEEE Commun. Surv. Tutor., vol. 22, no. 3, pp. 1863–1886, 2020.
  4. N. Eshraghi and B. Liang, “Joint offloading decision and resource allocation with uncertain task computing requirement,” in Proc. IEEE INFOCOM, 2019, pp. 1414–1422.
  5. M. Hamdi, A. Hamed, D. Yuan, and M. Zaied, “Energy-efficient joint task assignment and power control in energy-harvesting D2D offloading communications,” IEEE Internet Things J., vol. 9, no. 8, pp. 6018–6031, 2022.
  6. H. Zeng, X. Li, S. Bi, and X. Lin, “Delay-sensitive task offloading with D2D service-sharing in mobile edge computing networks,” IEEE Wirel. Commun. Lett., vol. 11, no. 3, pp. 607–611, 2022.
  7. J. Peng, H. Qiu, J. Cai, W. Xu, and J. Wang, “D2D-assisted multi-user cooperative partial offloading, transmission scheduling and computation allocating for MEC,” IEEE Trans. Wirele. Commun., vol. 20, no. 8, pp. 4858–4873, 2021.
  8. M. Chen, H. Wang, D. Han, and X. Chu, “Signaling-based incentive mechanism for D2D computation offloading,” IEEE Internet Things J., vol. 9, no. 6, pp. 4639–4649, 2022.
  9. H. Zhou, T. Wu, H. Zhang, and J. Wu, “Incentive-driven deep reinforcement learning for content caching and D2D offloading,” IEEE J. Sel. Areas Commun., vol. 39, no. 8, pp. 2445–2460, 2021.
  10. L. Pu, X. Chen, J. Xu, and X. Fu, “D2D fogging: An energy-efficient and incentive-aware task offloading framework via network-assisted D2D collaboration,” IEEE J. Sel. Areas Commun., vol. 34, no. 12, pp. 3887–3901, 2016.
  11. L. Li, T. Quek, J. Ren, et al, “An incentive-aware job offloading control framework for multi-access edge computing,” IEEE Trans. Mob. Comp., vol. 20, no. 1, pp. 63–75, 2021.
  12. H. Zhou, X. Chen, S. He, et al, “Freshness-aware seed selection for offloading cellular traffic through opportunistic mobile networks,”  IEEE Trans. Wire. Commun., vol. 19, no. 4, pp. 2658–2669, 2020.
  13. D. Han, W. Chen, and Y. Fang, “Opportunistic WiFi offloading in a vehicular environment: An MDP approach,” in Proc. IEEE ICC, 2020, pp. 1–6.
  14. S. Mu, Z. Zhong, and D. Zhao, “Online policy learning for opportunistic mobile  computation offloading,” in Proc. IEEE Globecom, 2020, pp. 1–6.
  15. X. Qin, G. Huang, B. Zhang, and C. Li, “Sparse relays assisted opportunistic routing for data  offloading in vehicular networks,” in Proc. IEEE ICC, 2021, pp. 1–6.
  16. D. Wang, Z. Liu, X. Wang, and Y. Lan, “Mobility-aware task offloading and migration schemes in fog computing networks,” IEEE Access, no. 7, pp. 43 356–43 368, 2019.
  17. U. Saleem, Y. Liu, S. Jangsher, Y Li, and T. Jiang, “Mobility-aware joint task scheduling and resource allocation for cooperative mobile edge computing,” IEEE Trans. Wirel. Commun., vol. 20, no. 1, pp. 360–374, 2021.
  18. Z. Wang, Z. Zhao, G. Min, X. Huang, Q. Ni, and R. Wang, “User mobility aware task assignment for mobile edge computing,” Future Gener. Comput. Syst., vol. 85, pp. 1–8, 2018.
  19. C. Wang, Y. Li, and D. Jin, “Mobility-assisted opportunistic computation offloading,” IEEE Commun. Lett., vol. 18, no. 10, pp. 1779–1882, 2014.
  20. M. Chen, Y. Hao, C. Lai, et al, “Opportunistic task scheduling over co-located clouds in  mobile  environment,” IEEE Trans. Serv. Comput., vol. 11, no. 3, pp. 549–561, 2018.
  21. G. Ahani and D. Yuan, “BS-assisted task offloading for D2D networks with  presence of user mobility,” in Proc. IEEE VTC Spring, 2019, pp. 1–5.
  22. S. Li, C. Li, Y. Huang, B. Jalanian, Y. Hou, and W. Lou, “Task offloading with uncertain processing cycle,” in Proc. ACM MOBIHOC, 2021, pp. 51–60.
  23. K. Li, “Non-clairvoyant and randomised online task offloading in mobile edge computing,” IJPEDS, accepted, 2022.
  24. Y. Fang, I. Chlamtac, and Y. B. Lin, “Channel occupancy times and handoff rate for mobile computing and PCS networks,” IEEE Trans. Comput., vol. 47, pp. 679–692, June 1998.
  25. J. Munkres, “Algorithms for the assignment and transportation problems ,” Journal of SIAM, vol. 5, no. 1, pp. 32–38, 1957.
  26. T. Deng, P. Fan, and D. Yuan, “Modeling and optimization of mobility-aware dynamic caching with time-varying content popularity,” IEEE Trans., Veh. Technol., vol. 69, no. 1, pp. 1157–1162, 2020.
  27. T. Deng, G. Ahani, P. Fan, and D. Yuan, “Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches,” IEEE Trans. Wireless Commun., vol. 17, no. 5, pp. 3082–3094, 2018.
  28. R. Wang, J. Zhang, S. Song, and K. Letaief, “Exploiting mobility in cache-assisted D2D networks: Performance analysis and optimization,” IEEE Trans. Wirele. Commun., vol. 17, no. 8, pp. 5592–5605, 2018.
  29. T. Deng, P. Fan, and D. Yuan, “Optimizing retention-aware caching in vehicular networks,” IEEE Trans., Commun., vol. 67, no. 9, pp. 1–14, 2019.
  30. H. Zhu, L. Fu, G. Xue, Y. Zhu, M. Li, and L. Ni, “Recognizing exponential inter-contact time in vanets,” in Proc. IEEE INFOCOM, 2010, pp. 1–6.
  31. Y. Li, D. Jin, L. Zeng, and S. Chen, “Revealing patterns of opportunistic contact durations and intervals for large scale urban vehicular mobility,,” in Proc. IEEE ICC, 2013, pp. 1–5.
Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.