# Genetic Algorithm-Based Cooperative Coding and Caching Data Dissemination Scheme in Multi-UAV-Enabled Internet of Vehicles

## TL;DR

This paper proposes a genetic algorithm-based data dissemination scheme for multi-UAV systems in disaster areas to improve efficiency and reduce energy use.

## Contribution

A novel genetic algorithm-based cooperative scheduling approach (GCS) is introduced to optimize bandwidth efficiency in multi-UAV data dissemination.

## Key findings

- The C2BS problem is proven to be NP-hard using polynomial time reduction techniques.
- The GCS algorithm demonstrates improved performance in bandwidth efficiency and energy consumption compared to existing methods.
- Simulation results validate the effectiveness of the proposed data dissemination scheme.

## Abstract

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs’ bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs’ energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs’ bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme.