Routing Strategy of Integrated Satellite-Terrestrial Network Based on Hyperbolic Geometry

Abstract

The integrated satellite-terrestrial network has the characteristics of large scale, complex, high dynamic and heterogeneousness. Adopting traditional routing methods in the integrated satellite-terrestrial network will cause problems of poor scalability and large routing overhead. Greedy forwarding strategy based on network mapping with hyperbolic geometry works well in large scale network. However, there is no study on applying the network mapping with hyperbolic geometry to complex networks beyond two dimensions, including the integrated satellite-terrestrial network. Based on the method of spherical polar projection, this paper proposes a hyperbolic coordinates mapping algorithm in three-dimensional geographic space suitable for the integrated satellite-terrestrial network. This algorithm gives nodes of heterogeneous layers in the integrated satellite-terrestrial network a unified expression based on four-dimensional hyperbolic coordinates, which helps to quickly identify and locate nodes without global information distribution and scheduling when routing. The routing strategy using greedy forwarding strategy based on this algorithm only costs low storage overhead, as it does not need routing tables. Simulations demonstrate that the performance of the algorithm is hardly affected by the exponential expansion of the network size, which means the property of scalability is excellent. Also, it is stable under heterogeneous network structure, and maintains a stable routing success rate for optimal path selection around 93% with a time complexity of O(n).INDEX TERMS Integrated satellite-terrestrial network, hyperbolic geometry, network mapping, greedy forwarding.

Link-State Aware Hybrid Routing in the Terrestrial–Satellite Integrated Network

“…Graph theory has been proposed and drawn a significant amount of research interests in predictable dynamic networks [ 30 , 31 , 32 , 33 , 34 , 35 , 36 , 37 , 38 ]. Ivanov et al proposed graph-based resource allocation for integrated space and terrestrial communications in [ 30 ], where the inter-connectivity and coexistence of various terrestrial and non-terrestrial networks are described via a hypergraph and its attributes.…”

“…To handle the time-varying topology, frequent link handover and imbalanced communication load, GRouting algorithm combining graph neural networks with deep reinforcement learning is proposed to dynamically find the optimal routing paths for the LEO satellite. To achieve efficient observation data transmission, recent works [ 34 , 35 , 36 ] design a communication link planning algorithm according to the network topology information. For example, according to the greedy forwarding strategy, Lv et al [ 34 ] proposed a hyperbolic geometry-based routing strategy to decrease storage overhead.…”

“…To achieve efficient observation data transmission, recent works [ 34 , 35 , 36 ] design a communication link planning algorithm according to the network topology information. For example, according to the greedy forwarding strategy, Lv et al [ 34 ] proposed a hyperbolic geometry-based routing strategy to decrease storage overhead. Furthermore, a service-aware communication link planning algorithm [ 37 , 38 ] is proposed to improve network performance.…”

“…Specifically, DSP adopts the gathered global propagation delay to find the optimal routing path, TLR is a load balancing routing scheme, which considers local route adjustment, NSR utilizes static cubes to find the shortest distance path, and SSLB is a distributed strategy, which diverts the traffic flow of congestion nodes to neighboring nodes. The proposed TSHR method is compared with the improved Open Shortest Path First+ (OSPF+) algorithm [ 17 ], Traffic-Aware Contact plan (TACR) algorithm [ 36 ], and Hyperbolic Geometry-based Routing (HGR) algorithm [ 34 ]. Specifically, OSPF+ takes advantage of the regularity of the constellation and conducts periodic route calculations to find the shortest distance path, TACR integrates traffic information into a mixed integer linear programming to find the optimal link connection planning, and HGR utilizes greedy forwarding strategy and hyperbolic geometry coordinate mapping to achieve optimal path selection.…”

Key Technologies of Sovereignty Network

“…In order to further improve the efficiency of routing, hyperbolic identifier and routing scheme [12,13] is proposed for the core networks which has more stable topology and under greater routing pressure than other parts. Then the hash table with prefix tree algorithm is designed for edge networks which topology changes frequently to support a huge amount of identifiers routing problem.…”