{"title":"Multi-User Offloading and Resource Allocation for Vehicular Multi-Access Edge Computing","authors":"Wenhan Zhan, H. Duan, Qingxin Zhu","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00037","DOIUrl":null,"url":null,"abstract":"By providing computation capability in the vicinity of vehicle terminals (VTs), multi-access edge computing (MEC) enables resource-demanding in-vehicle applications with significantly lower latency and less energy consumption. In this paper, we investigate the problem of offloading decision and resource allocation among multiple VTs to achieve the optimal system-wide user utility. Under the constraints of computation and wireless channel resources and VTs' mobility, this problem is mixed-integer non-linear programming (MINLP), which is generally NP-hard. A heuristic offloading decision method (HODM) is proposed, which decomposes the original problem into two subproblems, i.e., a convex computation allocation subproblem and a non-linear integer programming (NLIP) offloading decision subproblem, and settles them respectively. The convex subproblem is solved with a numerical method to obtain the optimal computation allocation among multiple offloading VTs, and a genetic algorithm (GA) based search algorithm is designed for the NLIP subproblem to determine the offloading decision. Several methods are utilized to reduce the enormous search space of this problem to make our solution more efficient. Extensive simulations are conducted by comparing with four baseline algorithms to demonstrate the superior performance of the proposed HODM.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

By providing computation capability in the vicinity of vehicle terminals (VTs), multi-access edge computing (MEC) enables resource-demanding in-vehicle applications with significantly lower latency and less energy consumption. In this paper, we investigate the problem of offloading decision and resource allocation among multiple VTs to achieve the optimal system-wide user utility. Under the constraints of computation and wireless channel resources and VTs' mobility, this problem is mixed-integer non-linear programming (MINLP), which is generally NP-hard. A heuristic offloading decision method (HODM) is proposed, which decomposes the original problem into two subproblems, i.e., a convex computation allocation subproblem and a non-linear integer programming (NLIP) offloading decision subproblem, and settles them respectively. The convex subproblem is solved with a numerical method to obtain the optimal computation allocation among multiple offloading VTs, and a genetic algorithm (GA) based search algorithm is designed for the NLIP subproblem to determine the offloading decision. Several methods are utilized to reduce the enormous search space of this problem to make our solution more efficient. Extensive simulations are conducted by comparing with four baseline algorithms to demonstrate the superior performance of the proposed HODM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
车载多址边缘计算的多用户卸载与资源分配
通过在车载终端(vt)附近提供计算能力,多接入边缘计算(MEC)可以使资源要求高的车载应用具有更低的延迟和更少的能耗。在本文中,我们研究了卸载决策和资源分配问题,以实现最佳的系统范围内的用户效用。在计算量、无线信道资源和VTs移动性的约束下,该问题是混合整数非线性规划(MINLP),一般为NP-hard。提出了一种启发式卸载决策方法(HODM),将原问题分解为两个子问题,即凸计算分配子问题和非线性整数规划(NLIP)卸载决策子问题,并分别求解。采用数值方法求解了凸子问题,得到了多个卸载vt之间的最优计算分配;设计了基于遗传算法的NLIP子问题搜索算法,确定了卸载决策。利用了几种方法来减小该问题巨大的搜索空间,使我们的解决方案更加高效。通过与四种基线算法的比较,进行了大量的仿真,证明了所提出的HODM的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the RTWC 2019 Workshop Chairs Message from the NGDN 2019 Workshop Chairs Ideation Support System with Personalized Knowledge Level Prediction Message from the DSCI 2019 General Chairs Connection Degree Cost and Reward Based Algorithm in Cognitive Radio Networks
×
引用
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