在集成通信、传感和计算功能的车载网络中进行结构知识驱动的元学习以实现任务卸载

Ruijin Sun , Yao Wen , Nan Cheng , Wei Wang , Rong Chai , Yilong Hui
{"title":"在集成通信、传感和计算功能的车载网络中进行结构知识驱动的元学习以实现任务卸载","authors":"Ruijin Sun ,&nbsp;Yao Wen ,&nbsp;Nan Cheng ,&nbsp;Wei Wang ,&nbsp;Rong Chai ,&nbsp;Yilong Hui","doi":"10.1016/j.jiixd.2024.02.005","DOIUrl":null,"url":null,"abstract":"<div><p>Task offloading is a potential solution to satisfy the strict requirements of computation-intensive and latency-sensitive vehicular applications due to the limited onboard computing resources. However, the overwhelming upload traffic may lead to unacceptable uploading time. To tackle this issue, for tasks taking environmental data as input, the data perceived by roadside units (RSU) equipped with several sensors can be directly exploited for computation, resulting in a novel task offloading paradigm with integrated communications, sensing and computing (I-CSC). With this paradigm, vehicles can select to upload their sensed data to RSUs or transmit computing instructions to RSUs during the offloading. By optimizing the computation mode and network resources, in this paper, we investigate an I-CSC-based task offloading problem to reduce the cost caused by resource consumption while guaranteeing the latency of each task. Although this non-convex problem can be handled by the alternating minimization (AM) algorithm that alternatively minimizes the divided four sub-problems, it leads to high computational complexity and local optimal solution. To tackle this challenge, we propose a creative structural knowledge-driven meta-learning (SKDML) method, involving both the model-based AM algorithm and neural networks. Specifically, borrowing the iterative structure of the AM algorithm, also referred to as structural knowledge, the proposed SKDML adopts long short-term memory (LSTM) network-based meta-learning to learn an adaptive optimizer for updating variables in each sub-problem, instead of the handcrafted counterpart in the AM algorithm. Furthermore, to pull out the solution from the local optimum, our proposed SKDML updates parameters in LSTM with the global loss function. Simulation results demonstrate that our method outperforms both the AM algorithm and the meta-learning without structural knowledge in terms of both the online processing time and the network performance.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 302-324"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000106/pdfft?md5=40b4034f42d124042f5327bc76eb93ca&pid=1-s2.0-S2949715924000106-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Structural knowledge-driven meta-learning for task offloading in vehicular networks with integrated communications, sensing and computing\",\"authors\":\"Ruijin Sun ,&nbsp;Yao Wen ,&nbsp;Nan Cheng ,&nbsp;Wei Wang ,&nbsp;Rong Chai ,&nbsp;Yilong Hui\",\"doi\":\"10.1016/j.jiixd.2024.02.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Task offloading is a potential solution to satisfy the strict requirements of computation-intensive and latency-sensitive vehicular applications due to the limited onboard computing resources. However, the overwhelming upload traffic may lead to unacceptable uploading time. To tackle this issue, for tasks taking environmental data as input, the data perceived by roadside units (RSU) equipped with several sensors can be directly exploited for computation, resulting in a novel task offloading paradigm with integrated communications, sensing and computing (I-CSC). With this paradigm, vehicles can select to upload their sensed data to RSUs or transmit computing instructions to RSUs during the offloading. By optimizing the computation mode and network resources, in this paper, we investigate an I-CSC-based task offloading problem to reduce the cost caused by resource consumption while guaranteeing the latency of each task. Although this non-convex problem can be handled by the alternating minimization (AM) algorithm that alternatively minimizes the divided four sub-problems, it leads to high computational complexity and local optimal solution. To tackle this challenge, we propose a creative structural knowledge-driven meta-learning (SKDML) method, involving both the model-based AM algorithm and neural networks. Specifically, borrowing the iterative structure of the AM algorithm, also referred to as structural knowledge, the proposed SKDML adopts long short-term memory (LSTM) network-based meta-learning to learn an adaptive optimizer for updating variables in each sub-problem, instead of the handcrafted counterpart in the AM algorithm. Furthermore, to pull out the solution from the local optimum, our proposed SKDML updates parameters in LSTM with the global loss function. Simulation results demonstrate that our method outperforms both the AM algorithm and the meta-learning without structural knowledge in terms of both the online processing time and the network performance.</p></div>\",\"PeriodicalId\":100790,\"journal\":{\"name\":\"Journal of Information and Intelligence\",\"volume\":\"2 4\",\"pages\":\"Pages 302-324\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2949715924000106/pdfft?md5=40b4034f42d124042f5327bc76eb93ca&pid=1-s2.0-S2949715924000106-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information and Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2949715924000106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information and Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949715924000106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于车载计算资源有限,任务卸载是满足计算密集型和延迟敏感型车辆应用严格要求的一种潜在解决方案。然而,过大的上传流量可能会导致无法接受的上传时间。为解决这一问题,对于以环境数据为输入的任务,可直接利用配备多个传感器的路边装置(RSU)感知的数据进行计算,从而形成一种集成通信、传感和计算(I-CSC)的新型任务卸载模式。在这种模式下,车辆可以在卸载过程中选择将感知数据上传到 RSU 或将计算指令传输到 RSU。通过优化计算模式和网络资源,本文研究了基于 I-CSC 的任务卸载问题,以在保证每个任务的延迟的同时降低资源消耗所造成的成本。虽然交替最小化(AM)算法可以处理这个非凸问题,即交替最小化所划分的四个子问题,但它会导致较高的计算复杂度和局部最优解。为了应对这一挑战,我们提出了一种创造性的结构知识驱动元学习(SKDML)方法,其中涉及基于模型的 AM 算法和神经网络。具体来说,借用 AM 算法的迭代结构(也称为结构知识),所提出的 SKDML 采用基于长短期记忆(LSTM)网络的元学习来学习用于更新每个子问题中变量的自适应优化器,而不是 AM 算法中的手工制作的对应优化器。此外,为了从局部最优中提取解决方案,我们提出的 SKDML 利用全局损失函数更新 LSTM 中的参数。仿真结果表明,就在线处理时间和网络性能而言,我们的方法优于 AM 算法和不具备结构知识的元学习方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Structural knowledge-driven meta-learning for task offloading in vehicular networks with integrated communications, sensing and computing

Task offloading is a potential solution to satisfy the strict requirements of computation-intensive and latency-sensitive vehicular applications due to the limited onboard computing resources. However, the overwhelming upload traffic may lead to unacceptable uploading time. To tackle this issue, for tasks taking environmental data as input, the data perceived by roadside units (RSU) equipped with several sensors can be directly exploited for computation, resulting in a novel task offloading paradigm with integrated communications, sensing and computing (I-CSC). With this paradigm, vehicles can select to upload their sensed data to RSUs or transmit computing instructions to RSUs during the offloading. By optimizing the computation mode and network resources, in this paper, we investigate an I-CSC-based task offloading problem to reduce the cost caused by resource consumption while guaranteeing the latency of each task. Although this non-convex problem can be handled by the alternating minimization (AM) algorithm that alternatively minimizes the divided four sub-problems, it leads to high computational complexity and local optimal solution. To tackle this challenge, we propose a creative structural knowledge-driven meta-learning (SKDML) method, involving both the model-based AM algorithm and neural networks. Specifically, borrowing the iterative structure of the AM algorithm, also referred to as structural knowledge, the proposed SKDML adopts long short-term memory (LSTM) network-based meta-learning to learn an adaptive optimizer for updating variables in each sub-problem, instead of the handcrafted counterpart in the AM algorithm. Furthermore, to pull out the solution from the local optimum, our proposed SKDML updates parameters in LSTM with the global loss function. Simulation results demonstrate that our method outperforms both the AM algorithm and the meta-learning without structural knowledge in terms of both the online processing time and the network performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Editorial Board Editorial Board Secure performance comparison for NOMA: Reconfigurable intelligent surface or amplify-and-forward relay? Editorial Board Structural knowledge-driven meta-learning for task offloading in vehicular networks with integrated communications, sensing and computing
×
引用
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