AI Article Synopsis

  • - Unmanned Aerial Vehicles (UAVs) are useful in disaster recovery for delivering data, but limited onboard energy restricts their operational time, causing challenges in effective data distribution.
  • - This study introduces a data dissemination strategy for multi-UAV-enabled Internet of Vehicles (IoV) to optimize bandwidth efficiency while minimizing energy use, focusing on a new problem called C2BS (Coding-based Cooperative Broadcast Scheduling).
  • - The work proposes a Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to solve the C2BS problem, involving a detailed approach with coding schemes, fitness evaluation, and optimization techniques, with simulation results demonstrating its effectiveness.

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

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11281166PMC
http://dx.doi.org/10.3390/s24144443DOI Listing

Publication Analysis

Top Keywords

data dissemination
24
genetic algorithm-based
8
algorithm-based cooperative
8
coding caching
8
dissemination scheme
8
multi-uav-enabled internet
8
internet vehicles
8
efficient data
8
uavs' bandwidth
8
bandwidth efficiency
8

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!