A Probabilistic Computation Offloading Strategy for Vehicle-to-Everything Networks

Fan Jiang, Weiping Bai, Lei Liu, Chaowei Wang
{"title":"A Probabilistic Computation Offloading Strategy for Vehicle-to-Everything Networks","authors":"Fan Jiang, Weiping Bai, Lei Liu, Chaowei Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233805","DOIUrl":null,"url":null,"abstract":"Vehicle-to-everything (V2X) is regarded as a fundamental service offered by the studied B5G/6G wireless technology. However, data traffic services provided in V2X networks requires computation capabilities, presenting a tremendous challenge in ensuring excellent user experience. To address this demanding task, computation offloading emerges as an effective solution. In this paper, we propose a probabilistic computation offloading strategy for V2X networks. Specifically, in order to minimize the total network delay, we first investigate the characteristics of task types and then categorize them into different groups. In particular, a priority-based M/M/1 queueing model is designed to simulate the transmission and computation process for offloading various tasks, where a probabilistic offloading problem is then established to minimize the average response delay. Finally, the task’s optimal offloading probability problem is solved based on the sub-gradient search (SGS) algorithm. Simulation results demonstrate that by taking task characteristics and priorities into account, the constructed model can obtain the optimal offloading probability and also satisfy the requirement of low latency service.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicle-to-everything (V2X) is regarded as a fundamental service offered by the studied B5G/6G wireless technology. However, data traffic services provided in V2X networks requires computation capabilities, presenting a tremendous challenge in ensuring excellent user experience. To address this demanding task, computation offloading emerges as an effective solution. In this paper, we propose a probabilistic computation offloading strategy for V2X networks. Specifically, in order to minimize the total network delay, we first investigate the characteristics of task types and then categorize them into different groups. In particular, a priority-based M/M/1 queueing model is designed to simulate the transmission and computation process for offloading various tasks, where a probabilistic offloading problem is then established to minimize the average response delay. Finally, the task’s optimal offloading probability problem is solved based on the sub-gradient search (SGS) algorithm. Simulation results demonstrate that by taking task characteristics and priorities into account, the constructed model can obtain the optimal offloading probability and also satisfy the requirement of low latency service.
车对物网络的概率计算卸载策略
V2X (Vehicle-to-everything)被认为是B5G/6G无线技术提供的一项基础服务。然而,V2X网络提供的数据流量业务需要计算能力,这对确保良好的用户体验提出了巨大的挑战。为了解决这一艰巨的任务,计算卸载成为一种有效的解决方案。本文提出了一种面向V2X网络的概率计算卸载策略。具体来说,为了最小化网络总延迟,我们首先研究了任务类型的特征,然后将它们分为不同的组。特别设计了基于优先级的M/M/1队列模型,模拟了各种任务卸载的传输和计算过程,建立了概率卸载问题,使平均响应延迟最小化。最后,基于次梯度搜索(SGS)算法求解任务的最优卸载概率问题。仿真结果表明,在考虑任务特性和优先级的情况下,所构建的模型能够获得最优的卸载概率,同时满足低延迟服务的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信