Optimal Ground Station Selection for Low-Earth Orbiting Satellites
- URL: http://arxiv.org/abs/2410.16282v1
- Date: Fri, 04 Oct 2024 22:48:50 GMT
- Title: Optimal Ground Station Selection for Low-Earth Orbiting Satellites
- Authors: Duncan Eddy, Michelle Ho, Mykel J. Kochenderfer,
- Abstract summary: This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions.
It enables mission operators to precisely design their ground segment performance and costs.
- Score: 36.896695278624776
- License:
- Abstract: This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions that enables mission operators to precisely design their ground segment performance and costs. Space mission operators are increasingly turning to Ground-Station-as-a-Service (GSaaS) providers to supply the terrestrial communications segment to reduce costs and increase network size. However, this approach leads to a new challenge of selecting the optimal service providers and station locations for a given mission. We consider the problem of ground station selection as an optimization problem and present a general solution framework that allows mission designers to set their overall optimization objective and constrain key mission performance variables such as total data downlink, total mission cost, recurring operational cost, and maximum communications time-gap. We solve the problem using integer programming (IP). To address computational scaling challenges, we introduce a surrogate optimization approach where the optimal station selection is determined based on solving the problem over a reduced time domain. Two different IP formulations are evaluated using randomized selections of LEO satellites of varying constellation sizes. We consider the networks of the commercial GSaaS providers Atlas Space Operations, Amazon Web Services (AWS) Ground Station, Azure Orbital Ground Station, Kongsberg Satellite Services (KSAT), Leaf Space, and Viasat Real-Time Earth. We compare our results against standard operational practices of integrating with one or two primary ground station providers.
Related papers
- Tera-SpaceCom: GNN-based Deep Reinforcement Learning for Joint Resource Allocation and Task Offloading in TeraHertz Band Space Networks [11.881917133887102]
Tera-SpaceCom is envisioned as a promising technology to enable various space science and communication applications.
A graph neural network (GNN)-deep reinforcement learning (DRL)-based joint resource allocation and task offloading algorithm is proposed.
arXiv Detail & Related papers (2024-09-12T10:26:17Z) - A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system.
We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks.
The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem.
arXiv Detail & Related papers (2024-08-29T06:57:45Z) - Scalable Scheduling Policies for Quantum Satellite Networks [10.91414940065524]
We consider the problem of transmission scheduling in quantum satellite networks subject to resource constraints at the satellites and ground stations.
We show that the most general problem of assigning satellites to ground station pairs for entanglement distribution is NP-hard.
We propose four scalable algorithms and evaluate their performance for Starlink mega constellation.
arXiv Detail & Related papers (2024-05-15T15:58:12Z) - Security-Sensitive Task Offloading in Integrated Satellite-Terrestrial Networks [15.916368067018169]
We propose the deployment of LEO satellite edge in an integrated satellite-terrestrial networks (ISTN) structure to support textitsecurity-sensitive computing task offloading.
We model the task allocation and offloading order problem as a joint optimization problem to minimize task offloading delay, energy consumption, and the number of attacks while satisfying reliability constraints.
arXiv Detail & Related papers (2024-01-20T07:29:55Z) - DC-MRTA: Decentralized Multi-Robot Task Allocation and Navigation in
Complex Environments [55.204450019073036]
We present a novel reinforcement learning based task allocation and decentralized navigation algorithm for mobile robots in warehouse environments.
We consider the problem of joint decentralized task allocation and navigation and present a two level approach to solve it.
We observe improvement up to 14% in terms of task completion time and up-to 40% improvement in terms of computing collision-free trajectories for the robots.
arXiv Detail & Related papers (2022-09-07T00:35:27Z) - Optimal Entanglement Distribution using Satellite Based Quantum Networks [16.797145253236607]
Satellite quantum communication can distribute high quality quantum entanglements among ground stations that are geographically separated at very long distances.
This work focuses on optimal distribution of bipartite entanglements to a set of pair of ground stations using a constellation of orbiting satellites.
arXiv Detail & Related papers (2022-05-24T20:32:00Z) - Innovations in the field of on-board scheduling technologies [64.41511459132334]
This paper proposes an onboard scheduler, that integrates inside an onboard software framework for mission autonomy.
The scheduler is based on linear integer programming and relies on the use of a branch-and-cut solver.
The technology has been tested on an Earth Observation scenario, comparing its performance against the state-of-the-art scheduling technology.
arXiv Detail & Related papers (2022-05-04T12:00:49Z) - Deep Learning Aided Routing for Space-Air-Ground Integrated Networks
Relying on Real Satellite, Flight, and Shipping Data [79.96177511319713]
Current maritime communications mainly rely on satellites having meager transmission resources, hence suffering from poorer performance than modern terrestrial wireless networks.
With the growth of transcontinental air traffic, the promising concept of aeronautical ad hoc networking relying on commercial passenger airplanes is potentially capable of enhancing satellite-based maritime communications via air-to-ground and multi-hop air-to-air links.
We propose space-air-ground integrated networks (SAGINs) for supporting ubiquitous maritime communications, where the low-earth-orbit satellite constellations, passenger airplanes, terrestrial base stations, ships, respectively, serve as the space-, air-,
arXiv Detail & Related papers (2021-10-28T14:12:10Z) - GEO satellites on-orbit repairing mission planning with mission deadline
constraint using a large neighborhood search-genetic algorithm [2.106508530625051]
This paper proposes a large neighborhood search-adaptive genetic algorithm (LNS-AGA) for many-to-many on-orbit repairing mission planning.
In the many-to-many on-orbit repairing scenario, several servicing spacecrafts and target satellites are located in GEO orbits which have different inclination, RAAN and true anomaly.
The mission objective is to find the optimal servicing sequence and orbit rendezvous time of every servicing spacecraft to minimize total cost of all servicing spacecrafts with all target satellites repaired.
arXiv Detail & Related papers (2021-10-08T03:33:37Z) - Integrating LEO Satellite and UAV Relaying via Reinforcement Learning
for Non-Terrestrial Networks [51.05735925326235]
A mega-constellation of low-earth orbit (LEO) satellites has the potential to enable long-range communication with low latency.
We study the problem of forwarding packets between two faraway ground terminals, through an LEO satellite selected from an orbiting constellation.
To maximize the end-to-end data rate, the satellite association and HAP location should be optimized.
We tackle this problem using deep reinforcement learning (DRL) with a novel action dimension reduction technique.
arXiv Detail & Related papers (2020-05-26T05:39:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.