Research on Geographical Routing in Aeronautical Ad hoc Networks

This study addresses the inadequacies in the consideration of specific technological environments in the research of geographical routing for Aeronautical Ad hoc Networks (AANETs). It focuses on analyzing the performance of two geographical routing algorithms, Greedy Perimeter Stateless Routing (GPSR) and Geographic Load Share Routing (GLSR), under the combined conditions of single-beam directional antennas and Spatial Time Division Multiple Access (STDMA) link scheduling. Firstly, an AANET model incorporating single-beam directional antennas and STDMA link scheduling is established, and the time slot allocation is optimized using a simulated annealing algorithm. Secondly, the principles of the GPSR and GLSR algorithms are analyzed in detail based on this model. Lastly, the performance of both GPSR and GLSR algorithms is verified through simulation. The study demonstrates that, in the specific technological environment of AANETs considering single-beam directional antennas and STDMA link scheduling, the GLSR algorithm markedly outperforms GPSR by tripling node throughput and reducing average end-to-end delay by 80%.