Poster: Can Betweenness Centrality Mitigate Greedy Routing’s Sparse Network Problem?

Geographic greedy routing in sparse L-band Digital Aeronautical Communications System (LDACS) Air-to-Air (A2A) networks, typical during the system’s gradual deployment, often becomes stuck in local minima, requiring backup mechanisms. Instead of relying on such reactive measures, we propose combining the geographic advance metric with local Betweenness Centrality (BC). While global BC is infeasible due to its reliance on full network knowledge, our results show that local BC strongly correlates with its global counterpart. We further develop Subset Betweenness Centrality Routing (S-BCR), a protocol that combines local BC and geographic advance. We demonstrate through proof-of-concept simulations that it achieves higher routing success rates than either metric alone, all within tight beacon-size limits.