一种高效移动边缘资源池的D2D卸载方法

Junkai Liu, Ke Luo, Zhi Zhou, Xu Chen
{"title":"一种高效移动边缘资源池的D2D卸载方法","authors":"Junkai Liu, Ke Luo, Zhi Zhou, Xu Chen","doi":"10.23919/WIOPT.2018.8362882","DOIUrl":null,"url":null,"abstract":"The explosion of resource-hungry mobile applications has posed great challenges on the underlying mobile devices which typically have limited computation resource. In response, device-to-device (D2D) computation offloading is envisioned as a promising approach to the problem by gearing resource-rich devices and resource-poor devices. Towards real-time and efficient computation offloading, in this paper, we proposed a novel edge resource pooling framework called ERP, in which a massive crowd of devices at the network edge exploit D2D collaboration for pooling and sharing computation resource with each other. Specifically, we first formulate the utility maximization problem under both computation and communication constraints as a mixed-integer linear programming (MILP), which is further proven to be NP-hard. To address this challenge, we propose a centralized greedy heuristic based on the classical maximum network flow problem, which schedules the task offloading in a cost-efficient manner. Rigorous theoretical analysis and extensive evaluations demonstrate the effectiveness of the heuristic to some extent.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A D2D offloading approach to efficient mobile edge resource pooling\",\"authors\":\"Junkai Liu, Ke Luo, Zhi Zhou, Xu Chen\",\"doi\":\"10.23919/WIOPT.2018.8362882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The explosion of resource-hungry mobile applications has posed great challenges on the underlying mobile devices which typically have limited computation resource. In response, device-to-device (D2D) computation offloading is envisioned as a promising approach to the problem by gearing resource-rich devices and resource-poor devices. Towards real-time and efficient computation offloading, in this paper, we proposed a novel edge resource pooling framework called ERP, in which a massive crowd of devices at the network edge exploit D2D collaboration for pooling and sharing computation resource with each other. Specifically, we first formulate the utility maximization problem under both computation and communication constraints as a mixed-integer linear programming (MILP), which is further proven to be NP-hard. To address this challenge, we propose a centralized greedy heuristic based on the classical maximum network flow problem, which schedules the task offloading in a cost-efficient manner. Rigorous theoretical analysis and extensive evaluations demonstrate the effectiveness of the heuristic to some extent.\",\"PeriodicalId\":231395,\"journal\":{\"name\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2018.8362882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2018.8362882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

资源密集型移动应用程序的爆炸式增长对底层计算资源有限的移动设备提出了巨大的挑战。作为回应,设备到设备(D2D)计算卸载被设想为一种很有前途的方法,通过将资源丰富的设备和资源贫乏的设备结合起来来解决这个问题。为了实现实时高效的计算卸载,本文提出了一种新的边缘资源池框架ERP,在该框架中,网络边缘的大量设备利用D2D协作来池化和共享计算资源。具体而言,我们首先将计算和通信约束下的效用最大化问题表述为混合整数线性规划(MILP),并进一步证明了其np困难性。为了解决这一挑战,我们提出了一种基于经典最大网络流问题的集中式贪婪启发式算法,该算法以一种经济有效的方式调度任务卸载。严谨的理论分析和广泛的评价在一定程度上证明了启发式的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A D2D offloading approach to efficient mobile edge resource pooling
The explosion of resource-hungry mobile applications has posed great challenges on the underlying mobile devices which typically have limited computation resource. In response, device-to-device (D2D) computation offloading is envisioned as a promising approach to the problem by gearing resource-rich devices and resource-poor devices. Towards real-time and efficient computation offloading, in this paper, we proposed a novel edge resource pooling framework called ERP, in which a massive crowd of devices at the network edge exploit D2D collaboration for pooling and sharing computation resource with each other. Specifically, we first formulate the utility maximization problem under both computation and communication constraints as a mixed-integer linear programming (MILP), which is further proven to be NP-hard. To address this challenge, we propose a centralized greedy heuristic based on the classical maximum network flow problem, which schedules the task offloading in a cost-efficient manner. Rigorous theoretical analysis and extensive evaluations demonstrate the effectiveness of the heuristic to some extent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信