2020/10/16 by Jingjing Cui, Cui, Jingjing, Dong Liu +8
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Satellite Communication Systems
paper · pdf · doi:10.48550/arxiv.2010.08315
openalex publication_date 2020/10/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Relying on multi-hop communication techniques, aeronautical ad hoc networks (AANETs) seamlessly integrate ground base stations (BSs) and satellites into aircraft communications for enhancing the on-demand connectivity of planes in the air. In this integrated AANET context we investigate the shortest-path routing problem with the objective of minimizing the total delay of the in-flight connection from the ground BS subject to certain minimum-rate constraints for all selected links in support of low-latency and high-speed services. Inspired by the best-first search and priority queue concepts, we model the problem formulated by a weighted digraph and find the optimal route based on the shortest-path algorithm. Our simulation results demonstrate that aircraft-aided multi-hop communications are capable of reducing the total delay of satellite communications, when relying on real historical flight data.