Skip to main content

EdgeDrones: Co-Scheduling of Drones for Multi-Location Aerial Computing Missions.

Awada, U., Zhang, J., Chen, S., Li, S. and Yang, S., 2023. EdgeDrones: Co-Scheduling of Drones for Multi-Location Aerial Computing Missions. Journal of Network and Computer Applications, 215, 103632.

Full text available as:

[img]
Preview
PDF (OPEN ACCESS ARTICLE)
1-s2.0-S1084804523000516-main (1).pdf - Published Version
Available under License Creative Commons Attribution.

5MB
[img] PDF
1-s2.0-S1084804523000516-main.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial.

9MB
[img] PDF
cas-dc-template.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

8MB

DOI: 10.1016/j.jnca.2023.103632

Abstract

Low altitude platform (LAP) unmanned aerial vehicles (UAVs), also called drones, are currently being exploited by Edge computing (EC) systems to execute complex resource-hungry use cases, such as virtual reality, smart cities, autonomous vehicles, etc., by attaching portable edge devices on them. However, a typical drone has limited flight time, coupled with the resource-constrained attached edge device, which can jeopardize aerial computing missions if they are not holistically taking into consideration. Moreover, the fundamental challenge is how to co-schedule multi-drone among multi-location where EC services are needed, such that drones are scheduled to maximize the utility from the activities while meeting computing resource and flight time constraints. Therefore, for a given fleet of drones and tasks across disjointed target locations in a city, we derive a machine learning (ML) linear regression model that estimates these tasks resource requirement and excution time. Leveraging this estimation values, we jointly consider each drone’s flight time availability and its attached edge device resource capacity, and formulate a novel Multi-Location Capacitated Mission Scheduling Problem (MLCMSP) that selects suitable drones and co-schedules their flight routes with the least total distance to visit and execute tasks at the target locations. Then, we show that faster scheduling and execution of complex tasks at each location, while considering the inter-task dependencies is important to achieve effective solution for our MLCMSP. Hence, we further propose EdgeDrones, a variant bin-packing optimization approach through gang-scheduling of inter-dependent tasks that co-schedules and co-locates tasks tightly so as to achieve faster execution time, as well as to fully utilize available resources. Extensive experiments on Alibaba cluster trace with information on task dependencies (about 12,207,703 dependencies) show that EdgeDrones achieves up to 73% higher resource utilization, up to 17.6 times faster executions, and up to 2.87 times faster flight travel time compared to the baseline approaches.

Item Type:Article
ISSN:1084-8045
Uncontrolled Keywords:Edge computing; Aerial computing; Vehicle routing; Linear regression Execution time; Resource efficiency; Co-location
Group:Faculty of Science & Technology
ID Code:38393
Deposited By: Symplectic RT2
Deposited On:18 Apr 2023 10:01
Last Modified:23 May 2024 11:21

Downloads

Downloads per month over past year

More statistics for this item...
Repository Staff Only -