Early View
ORIGINAL PAPER

Robust Space-to-Ground Laser Communication Downlink Scheduling Under Uncertainty Derived From Multisource

Pei Lyu

Pei Lyu

School of Electronic Science and Engineering, Nanjing University, Nanjing, China

Search for more papers by this author
Kanglian Zhao

Corresponding Author

Kanglian Zhao

School of Electronic Science and Engineering, Nanjing University, Nanjing, China

Correspondence:

Kanglian Zhao ([email protected])

Search for more papers by this author
Tomaso de Cola

Tomaso de Cola

Institute of Communications and Navigation, German Aerospace Center, Wessling, Germany

Search for more papers by this author
Hangsheng Zhao

Hangsheng Zhao

School of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China

Search for more papers by this author
First published: 21 May 2025

Funding: This study was funded by the Unveiling and Leading Project of Nanjing University Integrated Research and Development Platform of Ministry of Education and the National Natural Science Foundation of China (62131012).

ABSTRACT

Space-to-ground laser communication (SGLC) utilizes laser beams to establish high-capacity bidirectional links between satellites and ground stations (GSs). However, its performance is significantly impaired by cloud cover and atmospheric turbulence. In practical SGLC downlink scheduling, uncertainties derived from such atmospheric conditions are inevitable. To the best of our knowledge, this work is the first to tackle downlink scheduling for SGLC under such uncertainties, with the objective of maximizing the total amount of data downloaded from satellites. We present a robust formulation of the scheduling problem that incorporates multisource uncertainties through budgeted uncertainty sets, consequently transforming the original problem into a bi-level optimization one with conflicting objectives. To address such problems, we first utilize McCormick envelopes to linearize bilinear terms in the inner optimization problem. We subsequently propose a KKT condition-based method to convert the bi-level structure into a single-level reformulation, which is further transformed into a tractable mixed-integer linear programming (MILP) model. Compared with the existing method, which does not consider such uncertainties, the proposed approach achieves robust scheduling strategies with respect to data throughput.

Conflicts of Interest

The authors declare no conflicts of interest.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.