TY - JOUR
T1 - A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks
AU - Megas, Vasileios
AU - Hoppe, Sandra
AU - Ozger, Mustafa
AU - Schupke, Dominic
AU - Cavdar, Cicek
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - This paper addresses the problem of providing internet connectivity to aircraft flying above the ocean without using satellite connectivity given the lack of ground network infrastructure in the relevant oceanic areas. Is it possible to guarantee a minimum flow rate to each aircraft flying over an ocean by forming an aeronautical ad hoc network and connecting that network to internet via a set of limited number of ground base stations at the coast as anchor points? We formulated the problem as mixed-integer-linear programming (MILP) to maximize the number of aircraft with flow data rate above a certain threshold. Since this multi-commodity flow problem is at least NP-complete, we propose a two-phase heuristic algorithm to efficiently form topology and assign flows to each aircraft by maximizing the minimum flow. The performance of the heuristic algorithm is evaluated over the North Atlantic Corridor, heuristic performs only 8% less than the optimal result with low densities. In high network densities, the connectivity percentage changes from 70% to 40% under 75 Mbps data rate threshold. Furthermore, the connectivity percentage is investigated for different network parameters such as altitude and compared to upper and lower bounds and a baseline algorithm.
AB - This paper addresses the problem of providing internet connectivity to aircraft flying above the ocean without using satellite connectivity given the lack of ground network infrastructure in the relevant oceanic areas. Is it possible to guarantee a minimum flow rate to each aircraft flying over an ocean by forming an aeronautical ad hoc network and connecting that network to internet via a set of limited number of ground base stations at the coast as anchor points? We formulated the problem as mixed-integer-linear programming (MILP) to maximize the number of aircraft with flow data rate above a certain threshold. Since this multi-commodity flow problem is at least NP-complete, we propose a two-phase heuristic algorithm to efficiently form topology and assign flows to each aircraft by maximizing the minimum flow. The performance of the heuristic algorithm is evaluated over the North Atlantic Corridor, heuristic performs only 8% less than the optimal result with low densities. In high network densities, the connectivity percentage changes from 70% to 40% under 75 Mbps data rate threshold. Furthermore, the connectivity percentage is investigated for different network parameters such as altitude and compared to upper and lower bounds and a baseline algorithm.
KW - ad-hoc networks
KW - aerial networks
KW - air to air communication
KW - aircraft connectivity
KW - direct air to ground communication
KW - mixed integer linear programming
KW - rate allocation
KW - Topology formation
UR - http://www.scopus.com/inward/record.url?scp=85141510004&partnerID=8YFLogxK
U2 - 10.1109/TMC.2022.3217924
DO - 10.1109/TMC.2022.3217924
M3 - Journal article
AN - SCOPUS:85141510004
SN - 1536-1233
VL - 23
SP - 12
EP - 28
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 1
ER -