Optimization-based scheduling for the single-satellite, multi-ground station communication problem

Spangelo, Sara; Cutler, James; Gilson, Kyle; Cohn, Amy

doi:10.1016/j.cor.2014.11.004

Cited by 87 publications

(47 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of them focused on the direct transmission scheme, i.e., the satellites communicate with the GSs directly. Specifically, the authors of [11] investigated the single-satellite multi-GS communication scheduling problem, which aims at maximizing the data downloaded from the satellite. The problem was formulated as a constrained mixed integer program (MIP), based on which the cases of linear and non-linear dynamics were both considered.…”

Section: Related Workmentioning

confidence: 99%

“…Then, we substitute the calculated solution into the objective function and obtain the optimal capacity value. We also note that, in previous works such as [11], [12], the capacity maximized scheduling solution was obtained for the direct transmission scheme with the off-the-shelf optimization software package. Accordingly, as a benchmark, we also solve the capacity maximization problem in our work via MOSEK [23], which is usually adopted to solve integer programs.…”

Section: Performance Analysismentioning

confidence: 99%

“…This is as expected since the proposed semi-closed form solution is optimal theoretically. Furthermore, compared to [11], [12], the proposed solution has a semi-closed form and thus requires lower computational complexity. To verify this, we run simulations to compare the CPU time required by the proposed solution and MOSEK.…”

Section: Performance Analysismentioning

confidence: 99%

“…Generally, satellites can directly deliver the data to the GSs or transfer the data with the aid of relayed satellites. The direct transmission approach was studied in previous works such as [11]- [15]. With the internetworked GSs and/or the dedicated space relay systems, such as Tracking and Data Relay Satellite System (TDRSS) [16], [17], Tianlian System [18], and European Data Relay Satellite (EDRS) system [19], more and more SDSs are now operated as part of an integrated space-terrestrial network.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Toward Optimized Network Capacity in Emerging Integrated Terrestrial-Satellite Networks

Gong

Shen

Zhao

et al. 2020

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

In this paper, we investigate the transmission schemes of space data systems for optimized network capacity in an integrated terrestrial-satellite network (ITSN) with a twolayered space segment. First, a theoretical model of the network capacity is developed to evaluate the strategy of utilizing both direct and relayed transmissions. Second, we consider the ideal and the resource-constrained scenarios in which the corresponding network capacity is modeled with respect to the scheduling scheme. In particular, closed form and semi-closed form solutions to the difficult integer programs are achieved via rigorous mathematical analysis. The proposed model is general for exploring the capacity of various satellite network deployments whose solutions have not been obtained in prior studies. Furthermore, we verify the potential capacity of the different transmission schemes based on the proposed solutions and prove that the system's network capacity can be significantly improved by the hybrid transmission scheme. The theoretical framework proposed in this paper is expected to provide constructive insights in the design for the future space segments of ITSN.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Toward Optimized Network Capacity in Emerging Integrated Terrestrial-Satellite Networks

Gong

Shen

Zhao

et al. 2020

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

show abstract

“…However, their research did not consider antenna support time and real operation modes. Xhafa et al [30] and Spangelo et al [31] studied the allocation of communication data within the visibility between multiple satellites or ground antennae and a single ground antenna or; a single satellite and multiple ground antennae, respectively. However, they did not consider multiple satellites and multiple ground antennae.…”

Section: Previous Workmentioning

confidence: 99%

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

Lee¹,

Kim²,

Chung³

et al. 2016

International Journal of Aeronautical and Space Sciences

View full text Add to dashboard Cite

Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

show abstract

On Formulating the Ground Scheduling Problem as a Multi-objective Bilevel Problem

Antoniou

Petelin

Papa

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, a bilevel multi-objective formulation of the Ground Scheduling Problem is presented. First, the problem is formulated as a bilevel optimisation problem (BOP), wherein the upper level (UL) is a biobjective problem determining the pairs of Ground Station (GS) to Spacecraft (SC) and the starting time of each event with objectives the maximisation of the access windows and the minimisation of the communication clashes of each GS. These two objectives of the UL can be assumed as a measure of the violation of the feasibility of a schedule. The lower level (LL) consists of a single objective optimisation problem that determines the duration of each event, with objectives the communication time requirement of SCs with GS and the total ground station usage, combined together to a weighted sum function. The approach used to solve this multi-objective BOP is a nested approach, where the Pareto front of the upper level is obtained by a multi-objective optimisation algorithm (NSGA2) and the lower level is solved using a GA. The formulation is tested on one small test case from literature and the relevant results are reported.

show abstract

Optimization-based scheduling for the single-satellite, multi-ground station communication problem

Cited by 87 publications

References 16 publications

Toward Optimized Network Capacity in Emerging Integrated Terrestrial-Satellite Networks

Toward Optimized Network Capacity in Emerging Integrated Terrestrial-Satellite Networks

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

On Formulating the Ground Scheduling Problem as a Multi-objective Bilevel Problem

Contact Info

Product

Resources

About