A Multi-Dimensional Resource Crowdsourcing Framework for Mobile Edge Computing

Yifan Pan, Lin Gao, Jingjing Luo, Tong Wang, Jiaqi Luo
{"title":"A Multi-Dimensional Resource Crowdsourcing Framework for Mobile Edge Computing","authors":"Yifan Pan, Lin Gao, Jingjing Luo, Tong Wang, Jiaqi Luo","doi":"10.1109/ICC40277.2020.9148952","DOIUrl":null,"url":null,"abstract":"Mobile Edge Computing (MEC) is a promising solution to tackle the upcoming computing tsunami in 5G era, by effectively utilizing the idle resource at the mobile edge. In this work, we study such an MEC scenario, where mobile devices at edge share their heterogeneous resources with each other, hence forming a multi-dimensional resource crowdsourcing (sharing) framework. We are interested in the problem of how to optimally offload tasks to mobile devices under this framework, aiming at minimizing the total energy cost and maximizing the overall task completion. To study the problem, we first propose a general task model, where each task is divided into multiple sequential subtasks according to their functionalities as well as resource requirements. Then, based on the task model, we propose a Joint Energy Consumption and Task Failure Probability Minimization Problem, which decides when and where each subtask will be offloaded to. The problem is challenging to solve, mainly due to the inherent constraints between the scheduling of different subtasks. Therefore, we propose several linearization methods to relax the constraints, and convert the original problem into an integer linear programming (ILP), which can be solved by many classic methods effectively. We further perform simulations, which show that our proposed solution outperforms the existing solutions (with indivisible tasks or without resource sharing) in terms of both the total cost and the task failure probability. Precisely, our proposed solution can reduce the total cost by $25\\%\\sim 85\\%$ and the task failure probability by $10\\%\\sim 35\\%$.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148952","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Mobile Edge Computing (MEC) is a promising solution to tackle the upcoming computing tsunami in 5G era, by effectively utilizing the idle resource at the mobile edge. In this work, we study such an MEC scenario, where mobile devices at edge share their heterogeneous resources with each other, hence forming a multi-dimensional resource crowdsourcing (sharing) framework. We are interested in the problem of how to optimally offload tasks to mobile devices under this framework, aiming at minimizing the total energy cost and maximizing the overall task completion. To study the problem, we first propose a general task model, where each task is divided into multiple sequential subtasks according to their functionalities as well as resource requirements. Then, based on the task model, we propose a Joint Energy Consumption and Task Failure Probability Minimization Problem, which decides when and where each subtask will be offloaded to. The problem is challenging to solve, mainly due to the inherent constraints between the scheduling of different subtasks. Therefore, we propose several linearization methods to relax the constraints, and convert the original problem into an integer linear programming (ILP), which can be solved by many classic methods effectively. We further perform simulations, which show that our proposed solution outperforms the existing solutions (with indivisible tasks or without resource sharing) in terms of both the total cost and the task failure probability. Precisely, our proposed solution can reduce the total cost by $25\%\sim 85\%$ and the task failure probability by $10\%\sim 35\%$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向移动边缘计算的多维资源众包框架
移动边缘计算(MEC)通过有效利用移动边缘的空闲资源,是应对即将到来的5G时代计算海啸的有希望的解决方案。在这项工作中,我们研究了这样一个MEC场景,其中边缘的移动设备彼此共享异构资源,从而形成一个多维资源众包(共享)框架。我们感兴趣的问题是如何在这个框架下将任务最优地卸载到移动设备上,以最小化总能量成本和最大化整体任务完成。为了研究这个问题,我们首先提出了一个通用的任务模型,其中每个任务根据其功能和资源需求划分为多个顺序子任务。然后,在任务模型的基础上,提出了一个联合能量消耗和任务失败概率最小化问题,该问题决定了每个子任务卸载的时间和地点。由于不同子任务的调度之间存在固有的约束,该问题的解决具有一定的挑战性。因此,我们提出了几种线性化方法来放宽约束,并将原始问题转化为整数线性规划(ILP),可以用许多经典方法有效地求解。我们进一步进行了仿真,结果表明我们提出的解决方案在总成本和任务失败概率方面都优于现有的解决方案(具有不可分割的任务或没有资源共享)。准确地说,我们提出的解决方案可以将总成本降低25%,任务失败概率降低10%,任务失败概率降低35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Full Duplex MIMO Digital Beamforming with Reduced Complexity AUXTX Analog Cancellation Cognitive Management and Control of Optical Networks in Dynamic Environments Offloading Media Traffic to Programmable Data Plane Switches Simultaneous Transmitting and Air Computing for High-Speed Point-to-Point Wireless Communication A YouTube Dataset with User-level Usage Data: Baseline Characteristics and Key Insights
×
引用
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