多访问部分计算卸载:双用户情况

Mahsa Salmani, T. Davidson
{"title":"多访问部分计算卸载:双用户情况","authors":"Mahsa Salmani, T. Davidson","doi":"10.23919/APCC.2017.8304092","DOIUrl":null,"url":null,"abstract":"The opportunity to offload computational tasks to computing resources embedded in the network infrastructure enables mobile users to expand the scope of the applications that can be processed and to reduce the energy required to complete them. In this paper we seek insight into the impact of the choice of the multiple access scheme that is employed when each of two users has a divisible task that they wish to complete with partial assistance from a computing resource at the access point. In particular, we obtain quasi-closed-form solutions for the partitioning of the problem, the transmission powers and the transmission rates that minimize the sum of the transmission energy and the local computation energy for each user, subject to latency, transmission power and achievable rate constraints. We consider both the case in which the multiple access scheme is unrestricted, and the case of time division multiple access. Our numerical results demonstrate that exploiting the full capabilities of the multiple access channel enables a substantial reduction in the energy expended by the users, especially when the users have significantly different channel gains.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Multiple access partial computational offloading: Two-user case\",\"authors\":\"Mahsa Salmani, T. Davidson\",\"doi\":\"10.23919/APCC.2017.8304092\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The opportunity to offload computational tasks to computing resources embedded in the network infrastructure enables mobile users to expand the scope of the applications that can be processed and to reduce the energy required to complete them. In this paper we seek insight into the impact of the choice of the multiple access scheme that is employed when each of two users has a divisible task that they wish to complete with partial assistance from a computing resource at the access point. In particular, we obtain quasi-closed-form solutions for the partitioning of the problem, the transmission powers and the transmission rates that minimize the sum of the transmission energy and the local computation energy for each user, subject to latency, transmission power and achievable rate constraints. We consider both the case in which the multiple access scheme is unrestricted, and the case of time division multiple access. Our numerical results demonstrate that exploiting the full capabilities of the multiple access channel enables a substantial reduction in the energy expended by the users, especially when the users have significantly different channel gains.\",\"PeriodicalId\":320208,\"journal\":{\"name\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APCC.2017.8304092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 23rd Asia-Pacific Conference on Communications (APCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APCC.2017.8304092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

将计算任务卸载给嵌入在网络基础设施中的计算资源的机会,使移动用户能够扩展可以处理的应用程序的范围,并减少完成这些应用程序所需的能量。在本文中,我们试图深入了解当两个用户中的每个用户都有一个可分割的任务,他们希望在接入点的计算资源的部分帮助下完成该任务时所采用的多址方案选择的影响。特别是,在时延、传输功率和可实现速率约束下,我们得到了问题的划分、传输功率和传输速率的准封闭解,使每个用户的传输能量和本地计算能量之和最小。我们考虑了不受限制的多址方案和时分多址方案。我们的数值结果表明,利用多址信道的全部功能可以大大减少用户消耗的能量,特别是当用户具有显著不同的信道增益时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiple access partial computational offloading: Two-user case
The opportunity to offload computational tasks to computing resources embedded in the network infrastructure enables mobile users to expand the scope of the applications that can be processed and to reduce the energy required to complete them. In this paper we seek insight into the impact of the choice of the multiple access scheme that is employed when each of two users has a divisible task that they wish to complete with partial assistance from a computing resource at the access point. In particular, we obtain quasi-closed-form solutions for the partitioning of the problem, the transmission powers and the transmission rates that minimize the sum of the transmission energy and the local computation energy for each user, subject to latency, transmission power and achievable rate constraints. We consider both the case in which the multiple access scheme is unrestricted, and the case of time division multiple access. Our numerical results demonstrate that exploiting the full capabilities of the multiple access channel enables a substantial reduction in the energy expended by the users, especially when the users have significantly different channel gains.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信