Interference Aware Service Migration in Vehicular Fog Computing

Vehicular Fog Computing (VFC) is a promising technique to enable ultra low service latency by exploiting the computation and storage resources of both Roadside Units (RSUs) and Serving Vehicles (SVs) such as buses and trams with rich resources. To tackle with the mobility of vehicles, the services a...

Full description

Bibliographic Details
Main Authors: Shuxin Ge, Meng Cheng, Xiaobo Zhou
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9086044/
id doaj-92152b5b962e49a29b17d7c1cbd80209
record_format Article
spelling doaj-92152b5b962e49a29b17d7c1cbd802092021-03-30T01:43:26ZengIEEEIEEE Access2169-35362020-01-018842728428110.1109/ACCESS.2020.29922759086044Interference Aware Service Migration in Vehicular Fog ComputingShuxin Ge0https://orcid.org/0000-0001-9257-7533Meng Cheng1https://orcid.org/0000-0003-3946-0023Xiaobo Zhou2https://orcid.org/0000-0002-9254-3963Tianjin Key Laboratory of Advanced Networking, College of Intelligence and Computing, Tianjin University, Tianjin, ChinaSchool of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Nomi, JapanTianjin Key Laboratory of Advanced Networking, College of Intelligence and Computing, Tianjin University, Tianjin, ChinaVehicular Fog Computing (VFC) is a promising technique to enable ultra low service latency by exploiting the computation and storage resources of both Roadside Units (RSUs) and Serving Vehicles (SVs) such as buses and trams with rich resources. To tackle with the mobility of vehicles, the services are usually migrated between RSUs and SVs, i.e., follow the vehicle, to maintain the benefits of VFC. However, making optimal service migration decisions in VFC is challenging due to the mobility of SVs and the interference between vehicles. In this paper, we investigate multi-vehicle service migration problem in VFC. We propose an efficient online algorithm, called FEE, to optimize the service migration for each vehicle in each time slot, where the latency in the current time slot, the expected latency in future time slots, and the interference among vehicles are minimized. The expected latency in future times slots is obtained by trajectory prediction based on hidden Markov model, and the interference is measured based on the server load. Finally, a series of simulations based on real-world mobility traces of Rome taxis are conducted to verify the superior performance of the proposed FEE algorithm as compared with the state-of-the-art solutions.https://ieeexplore.ieee.org/document/9086044/Service migrationvehicular fog computinghidden Markov modelinterference detection
collection DOAJ
language English
format Article
sources DOAJ
author Shuxin Ge
Meng Cheng
Xiaobo Zhou
spellingShingle Shuxin Ge
Meng Cheng
Xiaobo Zhou
Interference Aware Service Migration in Vehicular Fog Computing
IEEE Access
Service migration
vehicular fog computing
hidden Markov model
interference detection
author_facet Shuxin Ge
Meng Cheng
Xiaobo Zhou
author_sort Shuxin Ge
title Interference Aware Service Migration in Vehicular Fog Computing
title_short Interference Aware Service Migration in Vehicular Fog Computing
title_full Interference Aware Service Migration in Vehicular Fog Computing
title_fullStr Interference Aware Service Migration in Vehicular Fog Computing
title_full_unstemmed Interference Aware Service Migration in Vehicular Fog Computing
title_sort interference aware service migration in vehicular fog computing
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Vehicular Fog Computing (VFC) is a promising technique to enable ultra low service latency by exploiting the computation and storage resources of both Roadside Units (RSUs) and Serving Vehicles (SVs) such as buses and trams with rich resources. To tackle with the mobility of vehicles, the services are usually migrated between RSUs and SVs, i.e., follow the vehicle, to maintain the benefits of VFC. However, making optimal service migration decisions in VFC is challenging due to the mobility of SVs and the interference between vehicles. In this paper, we investigate multi-vehicle service migration problem in VFC. We propose an efficient online algorithm, called FEE, to optimize the service migration for each vehicle in each time slot, where the latency in the current time slot, the expected latency in future time slots, and the interference among vehicles are minimized. The expected latency in future times slots is obtained by trajectory prediction based on hidden Markov model, and the interference is measured based on the server load. Finally, a series of simulations based on real-world mobility traces of Rome taxis are conducted to verify the superior performance of the proposed FEE algorithm as compared with the state-of-the-art solutions.
topic Service migration
vehicular fog computing
hidden Markov model
interference detection
url https://ieeexplore.ieee.org/document/9086044/
work_keys_str_mv AT shuxinge interferenceawareservicemigrationinvehicularfogcomputing
AT mengcheng interferenceawareservicemigrationinvehicularfogcomputing
AT xiaobozhou interferenceawareservicemigrationinvehicularfogcomputing
_version_ 1724186565786206208