利用边缘计算在 IIoT 中实现 AoI 感知的部分计算卸载:基于深度强化学习的方法

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Cloud Computing Pub Date : 2023-10-30 DOI:10.1109/TCC.2023.3328614
Kai Peng;Peiyun Xiao;Shangguang Wang;Victor C. M. Leung
{"title":"利用边缘计算在 IIoT 中实现 AoI 感知的部分计算卸载:基于深度强化学习的方法","authors":"Kai Peng;Peiyun Xiao;Shangguang Wang;Victor C. M. Leung","doi":"10.1109/TCC.2023.3328614","DOIUrl":null,"url":null,"abstract":"With the rapid growth of the Industrial Internet of Things, a large amount of industrial data that needs to be processed promptly. Edge computing-based computation offloading can well assist industrial devices to process these data and reduce the overall time overhead. However, there are dependencies among tasks and some tasks have high latency requirements, so completing computation offloading while considering the above factors faces important challenges. In this article, we design a computation offloading method based on a directed acyclic graph task model by modeling task dependencies. In addition to considering traditional optimization objectives in previous computation offloading problems (e.g., latency, energy consumption, etc.), we also propose an age of information (AoI) model to reflect the freshness of information and transform the task offloading problem into an optimization problem for latency, energy consumption, and AoI. To address this issue, we propose a method based on an improved dueling double deep Q-network computation offloading algorithm, named ID3CO. Specifically, it combines the advantages of deep Q-network, double deep Q-network, and dueling deep Q-network algorithms while further utilizing deep residual neural networks to improve convergence. Extensive simulations are conducted to demonstrate that ID3CO outperforms the existing baselines in terms of performance.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AoI-Aware Partial Computation Offloading in IIoT With Edge Computing: A Deep Reinforcement Learning Based Approach\",\"authors\":\"Kai Peng;Peiyun Xiao;Shangguang Wang;Victor C. M. Leung\",\"doi\":\"10.1109/TCC.2023.3328614\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid growth of the Industrial Internet of Things, a large amount of industrial data that needs to be processed promptly. Edge computing-based computation offloading can well assist industrial devices to process these data and reduce the overall time overhead. However, there are dependencies among tasks and some tasks have high latency requirements, so completing computation offloading while considering the above factors faces important challenges. In this article, we design a computation offloading method based on a directed acyclic graph task model by modeling task dependencies. In addition to considering traditional optimization objectives in previous computation offloading problems (e.g., latency, energy consumption, etc.), we also propose an age of information (AoI) model to reflect the freshness of information and transform the task offloading problem into an optimization problem for latency, energy consumption, and AoI. To address this issue, we propose a method based on an improved dueling double deep Q-network computation offloading algorithm, named ID3CO. Specifically, it combines the advantages of deep Q-network, double deep Q-network, and dueling deep Q-network algorithms while further utilizing deep residual neural networks to improve convergence. Extensive simulations are conducted to demonstrate that ID3CO outperforms the existing baselines in terms of performance.\",\"PeriodicalId\":13202,\"journal\":{\"name\":\"IEEE Transactions on Cloud Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2023-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Cloud Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10301673/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10301673/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着工业物联网的快速发展,大量工业数据需要及时处理。基于边缘计算的计算卸载可以很好地帮助工业设备处理这些数据,减少整体时间开销。然而,由于任务之间存在依赖性,且部分任务对延迟要求较高,因此在考虑上述因素的同时完成计算卸载面临着重要挑战。本文通过对任务依赖性建模,设计了一种基于有向无环图任务模型的计算卸载方法。除了考虑以往计算卸载问题中的传统优化目标(如延迟、能耗等)外,我们还提出了信息年龄(AoI)模型来反映信息的新鲜度,并将任务卸载问题转化为延迟、能耗和 AoI 的优化问题。针对这一问题,我们提出了一种基于改进的决斗双深度 Q 网络计算卸载算法的方法,命名为 ID3CO。具体来说,它结合了深度 Q 网络、双深度 Q 网络和决斗深度 Q 网络算法的优点,同时进一步利用深度残差神经网络来提高收敛性。大量的仿真证明,ID3CO 在性能上优于现有的基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
AoI-Aware Partial Computation Offloading in IIoT With Edge Computing: A Deep Reinforcement Learning Based Approach
With the rapid growth of the Industrial Internet of Things, a large amount of industrial data that needs to be processed promptly. Edge computing-based computation offloading can well assist industrial devices to process these data and reduce the overall time overhead. However, there are dependencies among tasks and some tasks have high latency requirements, so completing computation offloading while considering the above factors faces important challenges. In this article, we design a computation offloading method based on a directed acyclic graph task model by modeling task dependencies. In addition to considering traditional optimization objectives in previous computation offloading problems (e.g., latency, energy consumption, etc.), we also propose an age of information (AoI) model to reflect the freshness of information and transform the task offloading problem into an optimization problem for latency, energy consumption, and AoI. To address this issue, we propose a method based on an improved dueling double deep Q-network computation offloading algorithm, named ID3CO. Specifically, it combines the advantages of deep Q-network, double deep Q-network, and dueling deep Q-network algorithms while further utilizing deep residual neural networks to improve convergence. Extensive simulations are conducted to demonstrate that ID3CO outperforms the existing baselines in terms of performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
期刊最新文献
WorkloadDiff: Conditional Denoising Diffusion Probabilistic Models for Cloud Workload Prediction A Lightweight Privacy-Preserving Ciphertext Retrieval Scheme Based on Edge Computing Generative Adversarial Privacy for Multimedia Analytics Across the IoT-Edge Continuum Corrections to “DNN Surgery: Accelerating DNN Inference on the Edge through Layer Partitioning” FedPAW: Federated Learning With Personalized Aggregation Weights for Urban Vehicle Speed Prediction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1