Towards Optimal Placement and Runtime Migration of Time-Sensitive Services of Connected and Automated Vehicles

IF 5.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Osama Elgarhy;Yannick Le Moullec;Luca Reggiani;Muhammad Moazam Azeem;Tarik Taleb;Muhammad Mahtab Alam
{"title":"Towards Optimal Placement and Runtime Migration of Time-Sensitive Services of Connected and Automated Vehicles","authors":"Osama Elgarhy;Yannick Le Moullec;Luca Reggiani;Muhammad Moazam Azeem;Tarik Taleb;Muhammad Mahtab Alam","doi":"10.1109/OJVT.2024.3496583","DOIUrl":null,"url":null,"abstract":"In this paper, the goal is to reduce the time needed for the placement and migration of services of Connected Automated Vehicles (CAVs) using precise hybrid positioning method. First, to place a service in a Multi-access Edge Computing (MEC) node, there should be sufficient resources in the served MEC node; otherwise, the service would be placed on the neighboring MEC node or even on the core node, resulting in higher delays. We start by modeling our problem with the aid of traffic theory to analytically obtain the necessary number of resources for achieving the desired delay. Second, to reduce the migration process delay, the migration should begin before the vehicle reaches the MEC node. Thus, an AI lane-based scheme is proposed to predict candidate nodes for migration based on precise positioning. Precise positioning data is acquired from a Real-Time Kinematic Global Navigation Satellite System (RTK- GNSS) measurement campaign. The obtained imbalanced raw data is treated and used in the prediction scheme, and the resulting prediction accuracy achieves 99.3%. Finally, we formulate a service placement and migration delay optimization problem and propose an algorithm to solve it. The algorithm shows a latency reduction of approximately 50% compared to the core placement and up to 29% compared to the benchmark prediction algorithm. Moreover, the simulation results for the proposed service placement and migration algorithm show that in case the MEC resource calculations are not used, the delay is 2.2 times greater than when they are used.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":"6 ","pages":"13-33"},"PeriodicalIF":5.3000,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750435","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of Vehicular Technology","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10750435/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the goal is to reduce the time needed for the placement and migration of services of Connected Automated Vehicles (CAVs) using precise hybrid positioning method. First, to place a service in a Multi-access Edge Computing (MEC) node, there should be sufficient resources in the served MEC node; otherwise, the service would be placed on the neighboring MEC node or even on the core node, resulting in higher delays. We start by modeling our problem with the aid of traffic theory to analytically obtain the necessary number of resources for achieving the desired delay. Second, to reduce the migration process delay, the migration should begin before the vehicle reaches the MEC node. Thus, an AI lane-based scheme is proposed to predict candidate nodes for migration based on precise positioning. Precise positioning data is acquired from a Real-Time Kinematic Global Navigation Satellite System (RTK- GNSS) measurement campaign. The obtained imbalanced raw data is treated and used in the prediction scheme, and the resulting prediction accuracy achieves 99.3%. Finally, we formulate a service placement and migration delay optimization problem and propose an algorithm to solve it. The algorithm shows a latency reduction of approximately 50% compared to the core placement and up to 29% compared to the benchmark prediction algorithm. Moreover, the simulation results for the proposed service placement and migration algorithm show that in case the MEC resource calculations are not used, the delay is 2.2 times greater than when they are used.
网联自动驾驶汽车时效性服务的优化布局与运行时迁移研究
本文的目标是利用精确混合定位方法来减少联网自动驾驶汽车服务的放置和迁移所需的时间。首先,要将服务放置在多访问边缘计算(MEC)节点中,所服务的MEC节点中应该有足够的资源;否则,服务将被放置在相邻的MEC节点上,甚至会被放置在核心节点上,从而导致更高的延迟。我们首先借助交通理论对问题进行建模,以解析地获得实现期望延迟所需的资源数量。其次,为了减少迁移过程的延迟,迁移应该在车辆到达MEC节点之前开始。在此基础上,提出了一种基于人工智能路径的基于精确定位的候选节点迁移预测方案。精确的定位数据是从实时动态全球导航卫星系统(RTK- GNSS)测量活动中获得的。对得到的不平衡原始数据进行处理并应用于预测方案中,预测精度达到99.3%。最后,我们提出了一个服务放置和迁移延迟优化问题,并提出了一种求解该问题的算法。该算法显示,与核心放置相比,延迟减少了大约50%,与基准预测算法相比,延迟减少了29%。此外,本文提出的服务放置和迁移算法的仿真结果表明,在不使用MEC资源计算的情况下,延迟是使用MEC资源计算时的2.2倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.60
自引率
0.00%
发文量
25
审稿时长
10 weeks
×
引用
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学术官方微信