Dynamic Super Round-Based Distributed Task Scheduling for UAV Networks

Subir Halder

doi:10.1109/TWC.2022.3200366

2023-02-01

Subir Halder *

Amrita Ghosal

Mauro Conti

DOI：10.1109/TWC.2022.3200366

原文链接

原文求助

摘要

En 中文

Networks of Unmanned Aerial Vehicles (UAVs) are emerging in many application domains, e.g., military surveillance. To perform collaborative tasks, the involved UAVs exchange several types of information, e.g., sensor data and commands. The major question here is how to schedule the tasks under dynamic traffic flows to provide network services. Existing solutions use the Round-Robin Strategy (RRS), where the tasks are scheduled statistically by dividing the time into fixed-length rounds. However, the RRS wastes significant network and device resources due to task scheduling in each round. This paper proposes DROVE- a novel clustering approach that allows the UAVs for dynamic task scheduling. However, determining the task scheduling is crucial, as it significantly affects several network parameters, e.g., throughput. Therefore, we devise the problem of distributed task scheduling under dynamic traffic flow scenarios to optimize the throughput. We propose a clustering task scheduling algorithm to serve dynamic traffic flows. Particularly, we integrate the dynamic traffic flows into the Lyapunov drift analysis framework, and determine the throughput optimality of our proposed scheduling algorithm. We perform extensive simulations to validate the effectiveness of DROVE. The results show that DROVE outperforms the state-of-the-art solutions in terms of energy consumption, clustering overhead, throughput, end-to-end delay, flow success rate and packet drop rate.

Keyword:

Task analysis

Dynamic scheduling

Autonomous aerial vehicles

Throughput

Heuristic algorithms

Vehicle dynamics

Optimal scheduling

Clustering

data traffic-level dynamics

energy-efficiency

scheduling design