Task Offloading with 5G Network Slicing for V2X Communications

G. Alkhoury, Sara Berri, A. Chorti
{"title":"Task Offloading with 5G Network Slicing for V2X Communications","authors":"G. Alkhoury, Sara Berri, A. Chorti","doi":"10.1109/GLOBECOM48099.2022.10001378","DOIUrl":null,"url":null,"abstract":"Vehicular Edge Computing (VEC) technology allows vehicles demanding significant computation and storage resources to offload their demands to the nearest edge computing node, aiming at reducing data transfer latency and enhancing the Quality of Service (QoS). Moreover, the heterogeneous applications of Vehicle-to-Everything (V2X) communications need an efficient management of the nodes' resources to satisfy the diverse requirements of the vehicles' demands. To this end, network slicing could be a promising solution. Task offloading algorithms in VEC proposed in the literature usually rely on offloading to a 5G base station (gNodeB) or a Road Side Unit (RSU) and do not differentiate between the various vehicular demands. In this paper, we study the task offloading problem with network slicing in V2X communications from vehicles to edge computing nodes hosted at gNodeBs, RSUs, and nearby vehicles. We model the network and formulate the problem as an integer linear program, with the objective of maximizing the volume of offloaded tasks from diverse services. We propose a heuristic algorithm and slicing schemes to find a near-optimal solution to the NP hard optimization problem. The simulation results show that considering offloading at nearby vehicles in addition to RSUs and gNodeBs yields better results in terms of acceptance ratio and resource utilization. Furthermore, it is found that it is beneficial to use an adaptive slicing scheme instead of relying on a fixed slicing; in particular, when the number of slices is large.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM48099.2022.10001378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Vehicular Edge Computing (VEC) technology allows vehicles demanding significant computation and storage resources to offload their demands to the nearest edge computing node, aiming at reducing data transfer latency and enhancing the Quality of Service (QoS). Moreover, the heterogeneous applications of Vehicle-to-Everything (V2X) communications need an efficient management of the nodes' resources to satisfy the diverse requirements of the vehicles' demands. To this end, network slicing could be a promising solution. Task offloading algorithms in VEC proposed in the literature usually rely on offloading to a 5G base station (gNodeB) or a Road Side Unit (RSU) and do not differentiate between the various vehicular demands. In this paper, we study the task offloading problem with network slicing in V2X communications from vehicles to edge computing nodes hosted at gNodeBs, RSUs, and nearby vehicles. We model the network and formulate the problem as an integer linear program, with the objective of maximizing the volume of offloaded tasks from diverse services. We propose a heuristic algorithm and slicing schemes to find a near-optimal solution to the NP hard optimization problem. The simulation results show that considering offloading at nearby vehicles in addition to RSUs and gNodeBs yields better results in terms of acceptance ratio and resource utilization. Furthermore, it is found that it is beneficial to use an adaptive slicing scheme instead of relying on a fixed slicing; in particular, when the number of slices is large.
面向V2X通信的5G网络切片任务分流
车辆边缘计算(VEC)技术允许需要大量计算和存储资源的车辆将其需求卸载到最近的边缘计算节点,旨在减少数据传输延迟并提高服务质量(QoS)。此外,车联网(V2X)通信的异构应用需要对节点资源进行有效管理,以满足车辆需求的多样化需求。为此,网络切片可能是一个很有前途的解决方案。文献中提出的VEC任务卸载算法通常依赖于卸载到5G基站(gNodeB)或路边单元(RSU),并且不区分各种车辆需求。在本文中,我们研究了V2X通信中的网络切片任务卸载问题,从车辆到托管在gndeb、rsu和附近车辆上的边缘计算节点。我们对网络进行建模,并将问题表述为一个整数线性规划,其目标是从不同的服务中最大限度地卸载任务。我们提出了一种启发式算法和切片方案来寻找NP困难优化问题的近最优解。仿真结果表明,除了考虑rsu和gndeb外,考虑附近车辆的卸载在接受率和资源利用率方面具有更好的效果。此外,发现使用自适应切片方案比依赖固定切片更有益;特别是当切片数量很大时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信