{"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}
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.