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 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.