Online Incentive Mechanism Design for Collaborative Offloading in Mobile Edge Computing

Gang Li, Jun Cai, Jing Ma
{"title":"Online Incentive Mechanism Design for Collaborative Offloading in Mobile Edge Computing","authors":"Gang Li, Jun Cai, Jing Ma","doi":"10.1109/GLOBECOM38437.2019.9013744","DOIUrl":null,"url":null,"abstract":"In this paper, an online truthful mechanism integrating task executor selection, computation and communication resource allocation is proposed. Different from most existing work in the literature that was based on offline settings, in our system model, upon the arrival of a smartphone user who requests task offloading, the base station (BS) needs to make a decision right away without knowing any future information. By considering each task's specific requirements in terms of data size, delay, and preference, we formulate a social-welfare-maximization problem and propose a novel online mechanism to solve it. Both theoretical analyses and numerical results show that our mechanism can guarantee feasibility, truthfulness, and computational efficiency with a competitive ratio of 3.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM38437.2019.9013744","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, an online truthful mechanism integrating task executor selection, computation and communication resource allocation is proposed. Different from most existing work in the literature that was based on offline settings, in our system model, upon the arrival of a smartphone user who requests task offloading, the base station (BS) needs to make a decision right away without knowing any future information. By considering each task's specific requirements in terms of data size, delay, and preference, we formulate a social-welfare-maximization problem and propose a novel online mechanism to solve it. Both theoretical analyses and numerical results show that our mechanism can guarantee feasibility, truthfulness, and computational efficiency with a competitive ratio of 3.
移动边缘计算协同卸载在线激励机制设计
本文提出了一种集任务执行器选择、计算和通信资源分配于一体的在线真实机制。与现有文献中大多数基于离线设置的工作不同,在我们的系统模型中,当智能手机用户请求任务卸载时,基站(BS)需要在不知道任何未来信息的情况下立即做出决定。通过考虑每个任务在数据大小、延迟和偏好方面的具体要求,我们提出了一个社会福利最大化问题,并提出了一种新的在线机制来解决它。理论分析和数值结果表明,该机制能够保证可行性、真实性和计算效率,且竞争比为3。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信