Dueling Double Deep Q-Network Based Computation Offloading and Resource Allocation Scheme for Internet of Vehicles

Fan Jiang, Y. Li, Changyin Sun, Chaowei Wang
{"title":"Dueling Double Deep Q-Network Based Computation Offloading and Resource Allocation Scheme for Internet of Vehicles","authors":"Fan Jiang, Y. Li, Changyin Sun, Chaowei Wang","doi":"10.1109/WCNC55385.2023.10118937","DOIUrl":null,"url":null,"abstract":"This paper investigates a computation offloading and resource allocation policy for multiple vehicle user equipments (VUEs) in the Internet of Vehicles (IoV). Aiming at balancing the delay and energy consumption during the offloading procedure, a Support Vector Machine (SVM) is initially adopted to classify the offloading tasks into two categories according to different delay and energy consumption requirements. Consequently, VUEs can choose to offload the tasks to the mobile edge computing (MEC) server or other VUEs for completion. In particular, to further decrease the task offloading time in the MEC processing mode, the non-orthogonal multiple access (NOMA) scheme is adopted, which makes it possible for the MEC server to serve two VUEs simultaneously on the same sub-channel. To minimize the total cost, a Dueling Double Deep Q-Network (D3QN) based resource allocation algorithm is proposed, which can allocate the corresponding radio or computing resources under different task processing modes. Simulation results demonstrate that the proposed scheme can effectively reduce the total offloading cost within the maximum delay tolerance compared with existing methods.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC55385.2023.10118937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates a computation offloading and resource allocation policy for multiple vehicle user equipments (VUEs) in the Internet of Vehicles (IoV). Aiming at balancing the delay and energy consumption during the offloading procedure, a Support Vector Machine (SVM) is initially adopted to classify the offloading tasks into two categories according to different delay and energy consumption requirements. Consequently, VUEs can choose to offload the tasks to the mobile edge computing (MEC) server or other VUEs for completion. In particular, to further decrease the task offloading time in the MEC processing mode, the non-orthogonal multiple access (NOMA) scheme is adopted, which makes it possible for the MEC server to serve two VUEs simultaneously on the same sub-channel. To minimize the total cost, a Dueling Double Deep Q-Network (D3QN) based resource allocation algorithm is proposed, which can allocate the corresponding radio or computing resources under different task processing modes. Simulation results demonstrate that the proposed scheme can effectively reduce the total offloading cost within the maximum delay tolerance compared with existing methods.
基于Dueling双深度q网络的车联网计算卸载与资源分配方案
研究了车联网中多车辆用户设备(vue)的计算卸载和资源分配策略。为了平衡卸载过程中的延迟和能耗,初步采用支持向量机(SVM)根据不同的延迟和能耗要求将卸载任务分为两类。因此,vue可以选择将任务卸载到移动边缘计算(MEC)服务器或其他vue完成。特别是为了进一步减少MEC处理模式下的任务卸载时间,采用了非正交多址(NOMA)方案,使得MEC服务器可以在同一子信道上同时服务两个vue。为了使总成本最小化,提出了一种基于Dueling Double Deep Q-Network (D3QN)的资源分配算法,该算法可以在不同的任务处理模式下分配相应的无线电或计算资源。仿真结果表明,与现有方法相比,该方案能在最大延迟容限内有效降低总卸载成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信