4.7 Article

Multi-Agent DRL-Based Hungarian Algorithm (MADRLHA) for Task Offloading in Multi-Access Edge Computing Internet of Vehicles (IoVs)

期刊

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
卷 21, 期 9, 页码 7641-7652

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2022.3160099

关键词

Task analysis; Servers; Vehicle dynamics; Cloud computing; Reliability; Heuristic algorithms; Vehicle-to-infrastructure; Vehicular edge computing (VEC); deep reinforcement learning; task offloading; mode selection; IoV

资金

  1. University of Sydney

向作者/读者索取更多资源

This paper investigates the computation offloading problem in a high mobility internet of vehicles (IoVs) environment, and proposes a cooperative decentralized VMEC network to solve the task offloading problem in high mobility environments.
This paper investigates the computation offloading problem in a high mobility internet of vehicles (IoVs) environment, aiming to guarantee latency, energy consumption, and payment cost requirements. Both moving and parked vehicles are utilized as fog nodes. Vehicles in high mobility environments need collaborative interactions in a decentralized manner for better network performances, where agent action space grows exponentially with the number of vehicles. The vehicular mobility introduces additional dynamicity in the network, and the learning agent requires a joint cooperative behavior for establishing convergence. The traditional deep reinforcement learning (DRL)-based offloading in IoV ignores other agent's actions during the training process as an independent learner, which makes a lack of robustness against the high mobility environment. To overcome it, we develop a cooperative three-layer, more generic decentralized vehicle-assisted multi-access edge computing (VMEC) network, where vehicles in associated RSU and neighbor RSUs are in the bottom fog layer, MEC servers are in the middle cloudlet layer, and cloud in the top layer. Then multi-agent DRL-based Hungarian algorithm (MADRLHA) in the bipartite graph maximum matching problem is applied to solve dynamic task offloading in VMEC. Extensive experimental results and comprehensive comparisons are conducted to illustrate the superiority of our proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据