Search

The Interplanetary Network (IPN) emerges as the backbone for communication between various spacecraft and satellites orbiting distant celestial bodies. This paper introduces the Interplanetary Network Visualizer (IPN-V), a software platform that integrates interplanetary communications planning support, education, and outreach. IPN-V bridges the gap between the complexities of astrodynamics and network engineering by enabling the generation and assessment of dynamic, realistic network topologies that encapsulate the inherent challenges of space communication, such as time-evolving latencies and planetary occlusions. Leveraging the power of Unity 3D and C#, IPN-V provides a user-friendly 3D interface for the interactive visualization of interplanetary networks, incorporating contact tracing models to represent line-of-sight communication constraints accurately. IPN-V supports importing and exporting contact plans compatible with established space communication standards, including NASA's ION and HDTN formats. This paper delineates the conception, architecture, and operational framework of IPN-V while evaluating its performance metrics.

The end-to-end connectivity patterns between two points on Earth are highly volatile if mediated via a Low-Earth orbit (LEO) satellite constellation. This is rooted in the enormous speeds at which satellites in LEO must travel relative to the Earth's surface. While changes in end-to-end routes are rare events in stationary and terrestrial applications, they are a dominating factor for connection-oriented services running over LEO constellations and mega-constellations. This paper discusses how TCP-over-constellations is affected by the need for rerouting and how orbital route selection algorithms impact the end-to-end performance of communication. In contrast to the state of the art that primarily optimizes for instantaneous shortest routes (i.e. lowest delay), we propose several algorithms that have route stability and longevity in their focus. We show that this shift in focus comes with vastly improved end-to-end communication performance, and we discuss peculiar effects of the typical TCP-like implementations, taking inspiration from the Starlink constellation in our empirical investigations. The spectrum of algorithms proposed provides a basis for co-designing suitable orbital route selection algorithms and tailored transport control algorithms., Comment: 2024 IEEE International Conference on Communications Workshops (ICC Workshops), Denver, CO, USA, 2024, pp. 1708-1713

This paper provides a comprehensive overview of the uD3TN project's development, detailing its transformation into a flexible and modular software implementation of the Delay-/Disruption-Tolerant Networking (DTN) Bundle Protocol. Originating from uPCN, designed for microcontrollers, uD3TN has undergone significant architectural refinement to increase flexibility, compatibility, and performance across various DTN applications. Key developments include achieving platform independence, supporting multiple Bundle Protocol versions concurrently, introducing abstract Convergence Layer Adapter (CLA) interfaces, and developing the so called Application Agent Protocol (AAP) for interaction with the application layer. Additional enhancements, informed by field tests, include Bundle-in-Bundle Encapsulation and exploring a port to the Rust programming language, indicating the project's ongoing adaptation to practical needs. The paper also introduces the Generic Bundle Forwarding Interface and AAPv2, showcasing the latest innovations in the project. Moreover, it provides a comparison of uD3TN's architecture with the Interplanetary Overlay Network (ION) protocol stack, highlighting some general architectural principles at the foundation of DTN protocol implementations.

The accelerating growth of the Internet of Things (IoT) and its integration with Low-Earth Orbit (LEO) satellites demand efficient, reliable, and scalable communication protocols. Among these, the Long-Range Frequency Hopping Spread Spectrum (LR-FHSS) modulation, tailored for LEO satellite IoT communications, sparks keen interest. This work presents a joint approach to enhancing the scalability of LR-FHSS, addressing the demand for massive connectivity. We deepen into Frequency Hopping Sequence (FHS) mechanisms within LR-FHSS, spotlighting the potential of leveraging Wide-Gap sequences. Concurrently, we introduce two novel demodulator allocation strategies, namely, ``Early-Decode" and ``Early-Drop," to optimize the utilization of LoRa-specific gateway decoding resources. Our research further validates these findings with extensive simulations, offering a comprehensive look into the future potential of LR-FHSS scalability in IoT settings.

The emergence of low Earth orbit (LEO) satellite mega-constellations is dynamically transforming the space sector. While free-space optical (FSO) links efficiently facilitate intersatellite data forwarding, they suffer from atmospheric/weather conditions in the space-to-ground link. This study delves into utilizing high-altitude platform stations (HAPS) as elevated relay stations strategically positioned above terrestrial ground stations. We introduce the concept of high-altitude ground stations (HAGS), an innovative approach to enabling the development of all optical LEO satellite constellations. The first contribution is an analysis of the HAGS-based network architecture where the LEO spacecraft only hosts FSO transceivers. Secondly, we execute an extensive simulation campaign to determine the gain of HAGS, including a new equivalency model with the traditional ground station approach. Finally, we examine the research challenges of implementing HAGS-based, all optical LEO mega-constellations., Comment: IEEE International Conference on Communications 2024

Long-Range Frequency Hopping Spread Spectrum (LR-FHSS) is a recent modulation designed for communications from low-power ground end-devices to Low-Earth Orbit (LEO) satellites. To decode a frame, an LR-FHSS gateway must receive at least one header replica and a large proportion of payload fragments. However, LR-FHSS headers will likely be lost when there are many concurrent transmissions. In this paper, we motivate the header loss problem with an analytical model, propose a linear programming model to extract headerless frames and design a cost-effective sliding-window heuristic. Simulation results show that our approach exhibits near-optimal headerless detection and extraction results while ensuring a low computational cost. The proposed method is, therefore, suitable for future LR-FHSS gateways located onboard resource-constrained LEO satellites.

Recent breakthroughs in technology have led to a thriving "new space" culture in low-Earth orbit (LEO) in which performance and cost considerations dominate over resilience and reliability as mission goals. These advances create a manifold of opportunities for new research and business models but come with a number of striking new challenges. In particular, the size and weight limitations of low-Earth orbit small satellites make their successful operation rest on a fine balance between solar power infeed and the power demands of the mission payload and supporting platform technologies, buffered by on-board battery storage. At the same time, these satellites are being rolled out as part of ever-larger constellations and mega-constellations. Altogether, this induces a number of challenging computational problems related to the recurring need to make decisions about which task each satellite is to effectuate next. Against this background, GomSpace and Saarland University have joined forces to develop highly sophisticated software-based automated solutions rooted in optimal algorithmic and self-improving learning techniques, all this validated in modern nanosatellite networked missions operating in orbit., Comment: This is an author-generated technical report of a paper published in the Small Satellite Conference 2021

The design and launch of large-scale satellite networks create an imminent demand for efficient and delay-minimising routing methods. With the rising number of satellites in such constellations, pre-computing all shortest routes between all satellites and for all times becomes more and more infeasible due to space and time limitations. Even though distributed on-demand routing methods were developed for specific LEO satellite network configurations, they are not suited for increasingly popular mega-constellations based on Walker Delta formations. The contributions of this paper are twofold. First, we introduce a formal model that mathematically captures the time-evolving locations of satellites in a Walker Delta constellation and use it to establish a formula to compute the minimum number of ISL hops between two given satellites. In the second part, we present an on-demand hop-count-based routing algorithm that approximates the optimal path while achieving superior performance compared to classical shortest-path algorithms like Dijkstra., Comment: This is an extended version of a paper published in ASMS/SPSC 2022 containing proofs and further details. This work was part of the MISSION (Models in Space Systems: Integration, Operation, and Networking) project, funded by the European Union's Horizon 2020 research and innovation programme under Marie Sk{\l}odowska-Curie Actions grant number 101008233

Large geographical regions of our planet remain uncovered by terrestrial network connections. Sparse and dense constellations of near-Earth orbit satellites can bridge this gap by providing Internet of Things (IoT) connectivity on a world-wide scale in a flexible and cost-effective manner. This paper presents a novel space-terrestrial integrated IoT network architecture spanning direct- and indirect-to-satellite access from IoT assets on the surface. Framed on the identified requirements, we analyze NB-IoT and LoRa/LoRaWAN features to put these technologies forward as appealing candidates for future satellite IoT deployments. Finally, we list and discuss the key open research challenges to be addressed in order to achieve a successful space-terrestrial IoT integration.

Delay-Tolerant Networks (DTN) enable store-carry-and-forward data transmission in networks challenged by frequent disruptions and high latency. Existing classification distinguishes between scheduled and probabilistic DTNs, for which specific routing solutions have been developed. In this paper, we uncover a gap in-between where uncertain contact plans can be exploited to enhance data delivery in many practical scenarios described by probabilistic schedules available a priori. Routing under uncertain contact plans (RUCoP) is next formulated as a multiple-copy Markov Decision Process and then exported to local-knowledge (L-RUCoP) and Contact Graph Routing extensions (CGR-UCoP) which can be implemented in the existing DTN protocol stack. RUCoP and its derivations are evaluated in a first extensive simulation benchmark for DTNs under uncertain contact plans comprising both random and realistic scenarios. Results confirm that RUCoP and L-RUCoP closely approach the ideal delivery ratio of an oracle, while CGR-UCoP improves state-of-the-art DTN routing schemes delivery ratio up to 25%.