车联网环境下V2I/V2V混合多跳边缘计算卸载算法研究

Yueqing Wang, Xi Hu, Lijun Guo, Zhaoyang Yao
{"title":"车联网环境下V2I/V2V混合多跳边缘计算卸载算法研究","authors":"Yueqing Wang, Xi Hu, Lijun Guo, Zhaoyang Yao","doi":"10.1109/ICITE50838.2020.9231334","DOIUrl":null,"url":null,"abstract":"Due to the fast move of vehicle nodes and the limit cover range of the RSUs in IoV, one-hop MEC maybe is interrupted for the task vehicle moving out of the cover range of the current RSU. Therefore, multi-hop MEC is necessary to solve this problem. This paper proposes a V2I/V2V hybrid multi-hop edge computing offloading (VCMO) algorithm, which focuses on the optimal multi-hop edge computing offloading method. Furthermore, a multi-hop offloading overhead model is also established to evaluate the performance. The simulation results show that, comparing to other multihop edge computing offloading algorithms, VCMO has lowest offloading overhead.","PeriodicalId":112371,"journal":{"name":"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Research on V2I/V2V Hybrid Multi-hop Edge Computing Offloading Algorithm in IoV Environment\",\"authors\":\"Yueqing Wang, Xi Hu, Lijun Guo, Zhaoyang Yao\",\"doi\":\"10.1109/ICITE50838.2020.9231334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the fast move of vehicle nodes and the limit cover range of the RSUs in IoV, one-hop MEC maybe is interrupted for the task vehicle moving out of the cover range of the current RSU. Therefore, multi-hop MEC is necessary to solve this problem. This paper proposes a V2I/V2V hybrid multi-hop edge computing offloading (VCMO) algorithm, which focuses on the optimal multi-hop edge computing offloading method. Furthermore, a multi-hop offloading overhead model is also established to evaluate the performance. The simulation results show that, comparing to other multihop edge computing offloading algorithms, VCMO has lowest offloading overhead.\",\"PeriodicalId\":112371,\"journal\":{\"name\":\"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITE50838.2020.9231334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITE50838.2020.9231334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

由于车联网中车辆节点的快速移动和RSU的覆盖范围限制,当任务车辆移动到当前RSU的覆盖范围之外时,一跳MEC可能会中断。因此,需要多跳MEC来解决这一问题。本文提出了一种V2I/V2V混合多跳边缘计算卸载(VCMO)算法,重点研究了最优多跳边缘计算卸载方法。此外,还建立了多跳卸载开销模型来评估性能。仿真结果表明,与其他多跳边缘计算卸载算法相比,VCMO具有最低的卸载开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on V2I/V2V Hybrid Multi-hop Edge Computing Offloading Algorithm in IoV Environment
Due to the fast move of vehicle nodes and the limit cover range of the RSUs in IoV, one-hop MEC maybe is interrupted for the task vehicle moving out of the cover range of the current RSU. Therefore, multi-hop MEC is necessary to solve this problem. This paper proposes a V2I/V2V hybrid multi-hop edge computing offloading (VCMO) algorithm, which focuses on the optimal multi-hop edge computing offloading method. Furthermore, a multi-hop offloading overhead model is also established to evaluate the performance. The simulation results show that, comparing to other multihop edge computing offloading algorithms, VCMO has lowest offloading overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信