Computation Offloading in Heterogeneous Vehicular Edge Networks: On-line and Off-policy Bandit Solutions

• URL: http://arxiv.org/abs/2008.06302v1
• Date: Fri, 14 Aug 2020 11:48:13 GMT
• Title: Computation Offloading in Heterogeneous Vehicular Edge Networks: On-line and Off-policy Bandit Solutions
• Authors: Arash Bozorgchenani, Setareh Maghsudi, Daniele Tarchi, Ekram Hossain
• Abstract summary: In a fast-varying vehicular environment, the latency in offloading arises as a result of network congestion. We propose an on-line algorithm and an off-policy learning algorithm based on bandit theory. We show that the proposed solutions adapt to the traffic changes of the network by selecting the least congested network.
• Score: 30.606518785629046
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid advancement in vehicular communications and intelligent transportation systems technologies, task offloading in vehicular networking scenarios is emerging as a promising, yet challenging, paradigm in mobile edge computing. In this paper, we study the computation offloading problem from mobile vehicles/users, more specifically, the network- and base station selection problem, in a heterogeneous Vehicular Edge Computing (VEC) scenario, where networks have different traffic loads. In a fast-varying vehicular environment, the latency in computation offloading that arises as a result of network congestion (e.g. at the edge computing servers co-located with the base stations) is a key performance metric. However, due to the non-stationary property of such environments, predicting network congestion is an involved task. To address this challenge, we propose an on-line algorithm and an off-policy learning algorithm based on bandit theory. To dynamically select the least congested network in a piece-wise stationary environment, from the offloading history, these algorithms learn the latency that the offloaded tasks experience. In addition, to minimize the task loss due to the mobility of the vehicles, we develop a method for base station selection and a relaying mechanism in the chosen network based on the sojourn time of the vehicles. Through extensive numerical analysis, we demonstrate that the proposed learning-based solutions adapt to the traffic changes of the network by selecting the least congested network. Moreover, the proposed approaches improve the latency of offloaded tasks.

Related papers

• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• DNN Partitioning, Task Offloading, and Resource Allocation in Dynamic Vehicular Networks: A Lyapunov-Guided Diffusion-Based Reinforcement Learning Approach [49.56404236394601]
  We formulate the problem of joint DNN partitioning, task offloading, and resource allocation in Vehicular Edge Computing. Our objective is to minimize the DNN-based task completion time while guaranteeing the system stability over time. We propose a Multi-Agent Diffusion-based Deep Reinforcement Learning (MAD2RL) algorithm, incorporating the innovative use of diffusion models.
  arXiv  Detail & Related papers  (2024-06-11T06:31:03Z)
• Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using Graph Neural Networks [33.79834562046449]
  Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices. We propose a congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. Our approach is demonstrated to be effective in reducing congestion or unstable queues under the context-agnostic baseline, while improving the execution latency over local computing.
  arXiv  Detail & Related papers  (2023-12-05T03:46:30Z)
• Eco-Driving Control of Connected and Automated Vehicles using Neural Network based Rollout [0.0]
  Connected and autonomous vehicles have the potential to minimize energy consumption. Existing deterministic and methods created to solve the eco-driving problem generally suffer from high computational and memory requirements. This work proposes a hierarchical multi-horizon optimization framework implemented via a neural network.
  arXiv  Detail & Related papers  (2023-10-16T23:13:51Z)
• Knowledge-Driven Multi-Agent Reinforcement Learning for Computation Offloading in Cybertwin-Enabled Internet of Vehicles [24.29177900273616]
  We propose a knowledge-driven multi-agent reinforcement learning (KMARL) approach to reduce the latency of task offloading in cybertwin-enabled IoV. Specifically, in the considered scenario, the cybertwin serves as a communication agent for each vehicle to exchange information and make offloading decisions in the virtual space.
  arXiv  Detail & Related papers  (2023-08-04T09:11:37Z)
• AI-aided Traffic Control Scheme for M2M Communications in the Internet of Vehicles [61.21359293642559]
  The dynamics of traffic and the heterogeneous requirements of different IoV applications are not considered in most existing studies. We consider a hybrid traffic control scheme and use proximal policy optimization (PPO) method to tackle it.
  arXiv  Detail & Related papers  (2022-03-05T10:54:05Z)
• IoV Scenario: Implementation of a Bandwidth Aware Algorithm in Wireless Network Communication Mode [49.734868032441625]
  This paper proposes a bandwidth aware multi domain virtual network embedding algorithm (BA-VNE) The algorithm is mainly aimed at the problem that users need a lot of bandwidth in wireless communication mode. In order to improve the performance of the algorithm, we introduce particle swarm optimization (PSO) algorithm.
  arXiv  Detail & Related papers  (2022-02-03T03:34:06Z)
• Offline Contextual Bandits for Wireless Network Optimization [107.24086150482843]
  In this paper, we investigate how to learn policies that can automatically adjust the configuration parameters of every cell in the network in response to the changes in the user demand. Our solution combines existent methods for offline learning and adapts them in a principled way to overcome crucial challenges arising in this context.
  arXiv  Detail & Related papers  (2021-11-11T11:31:20Z)
• Cellular traffic offloading via Opportunistic Networking with Reinforcement Learning [0.5758073912084364]
  We propose an adaptive offloading solution based on the Reinforcement Learning framework. We evaluate and compare the performance of two well-known learning algorithms: Actor-Critic and Q-Learning. Our solution achieves a higher level of offloading with respect to other state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-10-01T13:34:12Z)
• Towards AIOps in Edge Computing Environments [60.27785717687999]
  This paper describes the system design of an AIOps platform which is applicable in heterogeneous, distributed environments. It is feasible to collect metrics with a high frequency and simultaneously run specific anomaly detection algorithms directly on edge devices.
  arXiv  Detail & Related papers  (2021-02-12T09:33:00Z)
• Deep Reinforcement Learning for Collaborative Edge Computing in Vehicular Networks [40.957135065965055]
  A collaborative edge computing framework is developed to reduce the computing service latency and improve service reliability for vehicular networks. An artificial intelligence (AI) based collaborative computing approach is developed to determine the task offloading, computing, and result delivery policy for vehicles. By our approach, the service cost, which includes computing service latency and service failure penalty, can be minimized via the optimal workload assignment and server selection.
  arXiv  Detail & Related papers  (2020-10-05T00:06:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.