TY - GEN
T1 - Space and Ground Data Routing via Non-ISL LEO Satellites for Near Real-Time Remote IoT Connectivity
AU - Jaouhari, Mouad
AU - Montecinos, Julio
AU - Sboui, Lokman
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Global Internet of Things (IoT) connectivity is challenged by limited terrestrial coverage, which can be solved by direct-to-satellite Low Earth Orbit (LEO) architectures. However, IoT-oriented LEO connectivity lacks inter-satellite links (ISLs), causing long delays. This paper presents a novel approach for enabling near real-time non-ISL satellite communications for IoT nodes in remote areas. Our method introduces a new data routing architecture that relays critical IoT messages between satellites and ground nodes until reaching a ground station (GS). We formulate the problem as a matrix of visibility waiting times and periods based on satellite orbits and IoT node locations. We then apply three matrix reductions that avoid unnecessary paths, followed by a Dijkstra-based algorithm for optimal message routing. The numerical results show that our proposed algorithm reduces computational complexity by 98% compared to brute-force while achieving the same accuracy in finding the lowest-delay path to GS.
AB - Global Internet of Things (IoT) connectivity is challenged by limited terrestrial coverage, which can be solved by direct-to-satellite Low Earth Orbit (LEO) architectures. However, IoT-oriented LEO connectivity lacks inter-satellite links (ISLs), causing long delays. This paper presents a novel approach for enabling near real-time non-ISL satellite communications for IoT nodes in remote areas. Our method introduces a new data routing architecture that relays critical IoT messages between satellites and ground nodes until reaching a ground station (GS). We formulate the problem as a matrix of visibility waiting times and periods based on satellite orbits and IoT node locations. We then apply three matrix reductions that avoid unnecessary paths, followed by a Dijkstra-based algorithm for optimal message routing. The numerical results show that our proposed algorithm reduces computational complexity by 98% compared to brute-force while achieving the same accuracy in finding the lowest-delay path to GS.
KW - Direct-to-Satellite IoT
KW - Hybrid Multi-Hop Architecture
KW - LEO satellite communications
KW - Non-ISL Constellations
KW - Routing Algorithms
UR - https://www.scopus.com/pages/publications/105018127204
U2 - 10.1109/ICCWorkshops67674.2025.11162323
DO - 10.1109/ICCWorkshops67674.2025.11162323
M3 - Contribution to conference proceedings
AN - SCOPUS:105018127204
T3 - 2025 IEEE International Conference on Communications Workshops, ICC Workshops 2025
SP - 1870
EP - 1875
BT - 2025 IEEE International Conference on Communications Workshops, ICC Workshops 2025
A2 - Valenti, Matthew
A2 - Reed, David
A2 - Torres, Melissa
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE International Conference on Communications Workshops, ICC Workshops 2025
Y2 - 8 June 2025 through 12 June 2025
ER -