Hybrid Geometric/Shortest-path Routing in Proliferated Low-Earth-Orbit Satellite Networks

被引:0
|
作者
Shake, Thomas [1 ]
机构
[1] MIT, Lincoln Lab, Cambridge, MA 02139 USA
关键词
D O I
10.1109/MILCOM58377.2023.10356345
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Routing data in satellite networks using predictable orbital geometry characteristics of a satellite constellation has been proposed in a number of studies. Orbital geometry may be used as a primary mechanism for determining routes or as an adjunct or a fallback to other routing techniques such as link-state routing. In cases where geometric information is used as an adjunct or fallback for a primary routing technique, the interactions between the primary and the adjunct/fallback routing mechanisms are of key importance in determining the routing performance of the combined routing mechanisms. This paper presents a study of a hybrid routing mechanism where some satellite routing nodes use shortest-path routing and other satellite routing nodes use a completely geometric approach to routing, with no exchange of routing table data or link state between different satellites using the two different routing mechanisms. A simple distributed procedure is presented for determining whether a given satellite uses shortest-path or geometric routing, and the routing performance in the overall constellation is calculated using random mixes of satellites using shortest-path vs geometric routing. Routing performance is characterized by path failure rate, latency, and transmission efficiency, and is calculated in an example medium-inclination 720-satellite Walker Delta satellite constellation. Performance is calculated in fully intact constellations and in the presence of satellite failures up to 8% of the satellites in the constellation.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Contingent Routing Using Orbital Geometry in Proliferated Low-Earth-Orbit Satellite Networks
    Shake, Thomas
    Sun, Jun
    Royster, Thomas
    Narula-Tam, Aradhana
    2022 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM), 2022,
  • [2] Shortest-path routing in arbitrary networks
    auf der Heide, FM
    Vöcking, B
    JOURNAL OF ALGORITHMS, 1999, 31 (01) : 105 - 131
  • [3] Throughput-Optimal Joint Routing and Scheduling for Low-Earth-Orbit Satellite Networks
    Kondrateva, Olga
    Doebler, Holger
    Sparka, Hagen
    Freimann, Andreas
    Scheuermann, Bjoern
    Schilling, Klaus
    2018 14TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS), 2018, : 59 - 66
  • [4] Recurrent neural networks for shortest-path routing
    Xia, YS
    Wang, J
    FUSION'98: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MULTISOURCE-MULTISENSOR INFORMATION FUSION, VOLS 1 AND 2, 1998, : 237 - 244
  • [5] On-Orbit Servicing System Architectures for Proliferated Low-Earth-Orbit Constellations
    Luu, Michael A. A.
    Hastings, Daniel E. E.
    JOURNAL OF SPACECRAFT AND ROCKETS, 2022, 59 (06) : 1946 - 1965
  • [6] A Probabilistic Resilient Routing Scheme for Low-Earth-Orbit Satellite Constellations
    Liu, Jiahao
    Wei, Ziling
    Zhao, Baokang
    Su, Jinshu
    Xin, Qin
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT III, 2021, 12939 : 254 - 261
  • [7] Geometric analysis of low-earth-orbit satellite communication systems: Covering functions
    Ulybyshev, Y
    JOURNAL OF SPACECRAFT AND ROCKETS, 2000, 37 (03) : 385 - 391
  • [8] Measuring a Low-Earth-Orbit Satellite Network
    Pan, Jianping
    Zhao, Jinwei
    Cai, Lin
    2023 IEEE 34TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, PIMRC, 2023,
  • [9] A Shortest-Path Tree Approach for Routing in Space Networks
    Olivier De Jonckère
    Juan A.Fraire
    China Communications, 2020, 17 (07) : 52 - 66
  • [10] Primal and dual neural networks for shortest-path routing
    Wang, J
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1998, 28 (06): : 864 - 869