Collaborative Service Provisioning for UAV-Assisted Mobile Edge Computing

IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Yuben Qu;Zhenhua Wei;Zhen Qin;Tao Wu;Jinghao Ma;Haipeng Dai;Chao Dong
{"title":"Collaborative Service Provisioning for UAV-Assisted Mobile Edge Computing","authors":"Yuben Qu;Zhenhua Wei;Zhen Qin;Tao Wu;Jinghao Ma;Haipeng Dai;Chao Dong","doi":"10.23919/cje.2021.00.323","DOIUrl":null,"url":null,"abstract":"Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC), as a way of coping with delay-sensitive and computing-intensive tasks, is considered to be a key technology to solving the challenges of terrestrial MEC networks. In this work, we study the problem of collaborative service provisioning (CSP) for UAV-assisted MEC. Specifically, taking into account the task latency and other resource constraints, this paper investigates how to minimize the total energy consumption of all terrestrial user equipments, by jointly optimizing computing resource allocation, task offloading, UAV trajectory, and service placement. The CSP problem is a non-convex mixed integer nonlinear programming problem, owing to the complex coupling of mixed integral variables and non-convexity of CSP. To address the CSP problem, this paper proposes an alternating optimization-based solution with the convergence guarantee as follows. We iteratively deal with the joint service placement and task offloading subproblem, and UAV movement trajectory subproblem, by branch and bound and successive convex approximation, respectively, while the closed form of the optimal computation resource allocation can be efficiently obtained. Extensive simulations validate the effectiveness of the proposed algorithm compared to three baselines.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"33 6","pages":"1504-1514"},"PeriodicalIF":1.6000,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748536","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chinese Journal of Electronics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10748536/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC), as a way of coping with delay-sensitive and computing-intensive tasks, is considered to be a key technology to solving the challenges of terrestrial MEC networks. In this work, we study the problem of collaborative service provisioning (CSP) for UAV-assisted MEC. Specifically, taking into account the task latency and other resource constraints, this paper investigates how to minimize the total energy consumption of all terrestrial user equipments, by jointly optimizing computing resource allocation, task offloading, UAV trajectory, and service placement. The CSP problem is a non-convex mixed integer nonlinear programming problem, owing to the complex coupling of mixed integral variables and non-convexity of CSP. To address the CSP problem, this paper proposes an alternating optimization-based solution with the convergence guarantee as follows. We iteratively deal with the joint service placement and task offloading subproblem, and UAV movement trajectory subproblem, by branch and bound and successive convex approximation, respectively, while the closed form of the optimal computation resource allocation can be efficiently obtained. Extensive simulations validate the effectiveness of the proposed algorithm compared to three baselines.
无人机辅助移动边缘计算的协作服务供应
无人飞行器(UAV)辅助移动边缘计算(MEC)作为一种应对延迟敏感和计算密集型任务的方法,被认为是解决地面 MEC 网络挑战的关键技术。在这项工作中,我们研究了无人机辅助 MEC 的协作服务供应(CSP)问题。具体来说,考虑到任务延迟和其他资源约束,本文研究了如何通过联合优化计算资源分配、任务卸载、无人机轨迹和服务投放,使所有地面用户设备的总能耗最小。由于混合积分变量的复杂耦合和 CSP 的非凸性,CSP 问题是一个非凸混合积分非线性编程问题。针对 CSP 问题,本文提出了一种基于交替优化的、具有收敛性保证的解决方案,具体如下。我们分别通过分支与约束和连续凸近似的方法迭代处理了联合服务安置和任务卸载子问题以及无人机运动轨迹子问题,同时可以高效地得到最优计算资源分配的闭合形式。大量仿真验证了所提算法与三种基线算法相比的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Chinese Journal of Electronics
Chinese Journal of Electronics 工程技术-工程:电子与电气
CiteScore
3.70
自引率
16.70%
发文量
342
审稿时长
12.0 months
期刊介绍: CJE focuses on the emerging fields of electronics, publishing innovative and transformative research papers. Most of the papers published in CJE are from universities and research institutes, presenting their innovative research results. Both theoretical and practical contributions are encouraged, and original research papers reporting novel solutions to the hot topics in electronics are strongly recommended.
×
引用
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学术官方微信