A delay-tolerant network approach to satellite pickup and delivery scheduling

Lowe, Christopher John and Clark, Ruaridh Alexander and McGrath, Ciara Nora and Macdonald, Malcolm (2023) A delay-tolerant network approach to satellite pickup and delivery scheduling. Ad Hoc Networks, 151. 103289. ISSN 1570-8705 (https://doi.org/10.1016/j.adhoc.2023.103289)

[thumbnail of Lowe-etal-AHN-2023-A-delay-tolerant-network-approach-to-satellite-pickup-and-delivery-scheduling]
Preview
 Text. Filename: Lowe_etal_AHN_2023_A_delay_tolerant_network_approach_to_satellite_pickup_and_delivery_scheduling.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (1MB)| Preview

Abstract

An approach to job scheduling and task allocation in delay- and disruption-tolerant satellite networks, called Contact Graph Scheduling (CGS) is introduced. This method aims to minimize latency between the arrival of requests for satellite data products, and the delivery of those products, identifying efficient pickup and delivery paths through a resource-constrained time-varying network. Requests for goods are processed as soon as they arrive, resulting in the discovery of task distribution and product delivery routes, while being aware of both resource and operational constraints. CGS sits at the interface between Contact Graph Routing (CGR), the dynamic pickup and delivery problem (dPDP) and satellite scheduling. CGS provides a combined scheduling-routing solution, such that the route to be taken by data toward their destination informs the allocation of pickup tasks to network nodes. Results show that CGS can increase the number of fulfilled customer requests, while maintaining acceptable levels of delivery latency, compared to other, less burdensome methods. This study highlights the impact of contact reliability on CGS performance, suggesting that as uncertainty increases, so does the benefit of employing locally, rather than centrally, defined data routing strategies.

CORE (COnnecting REpositories)