Twin-component near-Pareto routing optimization for AANETs in the North-Atlantic region relying on real flight statistics

• Main Authors: Cui, Jingjing, Yetgin, Halil, Liu, Dong, Zhang, Jiankang, Ng, Soon Xin, Hanzo, Lajos
• Format: Article in Journal/Newspaper
• Language: English
• Published: 2021
• Subjects: North Atlantic
• Online Access: https://eprints.soton.ac.uk/450278/; https://eprints.soton.ac.uk/450278/1/ojvt_moop.pdf

Integrated ground-air-space (IGAS) networks intrinsically amalgamate terrestrial and non-terrestrial communication techniques in support of universal connectivity across the globe. Multi-hop routing over the IGAS networks has the potential to provide long-distance highly directional connections in the sky. For meeting the latency and reliability requirements of in-flight connectivity, we formulate a multi-objective multi-hop routing problem in aeronautical ad hoc networks (AANETs) for concurrently optimizing multiple end-to-end performance metrics in terms of the total delay and the throughput. In contrast to single-objective optimization problems that may have a unique optimal solution, the problem formulated is a multi-objective combinatorial optimization problem (MOCOP), which generally has a set of trade-off solutions, called the Pareto optimal set. Due to the discrete structure of the MOCOP formulated, finding the Pareto optimal set becomes excessively complex for large-scale networks. Therefore, we employ a multi-objective evolutionary algorithm (MOEA), namely the classic NSGA-II for generating an approximation of the Pareto optimal set. Explicitly, with the intrinsic parallelism of MOEAs, the MOEA employed starts with a set of candidate solutions for creating and reproducing new solutions via genetic operators. Finally, we evaluate the MOCOP formulated for different networks generated both from simulated data as well as from real historical flight data. Our simulation results demonstrate that the utilized MOEA has the potential of finding the Pareto optimal solutions for small-scale networks, while also finding a set of high-performance nondominated solutions for large-scale networks.