1. Computation Offloading in Heterogeneous Vehicular Edge Networks:On-line and Off-policy Bandit Solutions
- Author
-
Ekram Hossain, Arash Bozorgchenani, Daniele Tarchi, Setareh Maghsudi, Bozorgchenani, Arash, Maghsudi, Setareh, Tarchi, Daniele, Hossain, Ekram, and Publica
- Subjects
Signal Processing (eess.SP) ,FOS: Computer and information sciences ,Computer Science - Machine Learning ,Computer Networks and Communications ,Computer science ,off-policy learning ,heterogeneous networks ,Machine Learning (cs.LG) ,Computer Science - Networking and Internet Architecture ,Base station ,bandit theory ,Server ,Vehicular edge computing (VEC) ,FOS: Electrical engineering, electronic engineering, information engineering ,Computation offloading ,Electrical and Electronic Engineering ,Latency (engineering) ,Electrical Engineering and Systems Science - Signal Processing ,Edge computing ,Networking and Internet Architecture (cs.NI) ,business.industry ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,computation offloading ,Task (computing) ,13. Climate action ,on-line learning ,Enhanced Data Rates for GSM Evolution ,business ,Software ,Heterogeneous network ,Task analysis, Edge computing, Servers, Base stations, Heuristic algorithms, Delays, Vehicle dynamics, Vehicular Edge Computing (VEC), computation offloading, heterogeneous networks, off-policy learning, on-line learning, bandit theory ,Computer network - Abstract
With the rapid advancement of Intelligent Transportation Systems (ITS) and vehicular communications, Vehicular Edge Computing (VEC) is emerging as a promising technology to support low-latency ITS applications and services. In this paper, we consider the computation offloading problem from mobile vehicles/users in a heterogeneous VEC scenario, and focus on the network- and base station selection problems, where different networks have different traffic loads. In a fast-varying vehicular environment, computation offloading experience of users is strongly affected by the latency due to the congestion at the edge computing servers co-located with the base stations. However, as a result of the non-stationary property of such an environment and also information shortage, predicting this congestion is an involved task. To address this challenge, we propose an on-line learning algorithm and an off-policy learning algorithm based on multi-armed bandit theory. To dynamically select the least congested network in a piece-wise stationary environment, these algorithms predict the latency that the offloaded tasks experience using the offloading history. In addition, to minimize the task loss due to the mobility of the vehicles, we develop a method for base station selection. Moreover, we propose a relaying mechanism for the selected network, which operates based on the sojourn time of the vehicles. Through intensive numerical analysis, we demonstrate that the proposed learning-based solutions adapt to the traffic changes of the network by selecting the least congested network, thereby reducing the latency of offloaded tasks. Moreover, we demonstrate that the proposed joint base station selection and the relaying mechanism minimize the task loss in a vehicular environment., Published in IEEE Transactions on Mobile Computing, Vol 21, Issue 12, Dec 2022
- Published
- 2022