Robust Divergence Angle for Inter-satellite Laser Communications under Target Deviation Uncertainty

Zhanwei Yu, Yi Zhao, Di Yuan

Abstract

Performance degradation due to target deviation, such as drift or jitter, is a significant challenge in inter-satellite laser communications (ISLC). Between periodic acquisition phases, satellites inevitably drift, making it difficult to maintain a precise link. This paper proposes a robust optimization approach to determine the optimal laser beam divergence angle without requiring a specific probability distribution for the deviation. By defining an uncertainty set of possible drift scenarios, the method seeks a divergence angle that maximizes the guaranteed performance (e.g., sum rate) across all scenarios. The problem is solved by alternating between a decision maker's problem and an adversarial problem, the latter of which is mapped to a graph-based shortest path problem. Simulation results demonstrate that this robust approach significantly outperforms traditional schemes that assume perfect alignment or use ad-hoc settings.

The Precision Challenge in Space

Inter-satellite laser communication offers massive bandwidth, but its success depends on surgical precision. Imagine trying to hit a small receiver with a laser pointer from 40 kilometers away while both platforms are in motion. While satellites use "acquisition" phases to align their lasers, they inevitably drift or jitter in the intervals between these phases.

Figure 2: Comparison of beam coverage under different divergence angles (θ) and target deviations (d). A narrow beam provides high intensity but misses the target if it drifts, while a wider beam ensures coverage at the cost of signal strength.

If the laser beam is too narrow (highly focused), even a tiny vibration can cause the signal to miss the receiver entirely, dropping the data rate to zero. Conversely, if the beam is too wide, the energy is spread too thin, resulting in a weak signal and slower speeds. Because this drift is incredibly hard to model or predict accurately, most existing solutions rely on assuming a specific probability distribution for the jitter, which may not reflect real-world conditions.

Methodology: Robust Optimization

The authors employ Robust Optimization (RO) to find a divergence angle that works well across a wide range of possible drift scenarios without needing to know the exact probability of any single one. Instead of optimizing for the "average" case, RO seeks the best solution for the "worst-case" scenario within a defined uncertainty set.

The Uncertainty Set and Iterative Algorithm

The "rules of the game" for satellite drift are defined by three constraints: the initial gap at the first time slot, the drift speed between consecutive moments, and a total "budget" for cumulative deviation over the entire time horizon. To solve this, the authors use an iterative "min-max" approach:

  1. Decision Maker’s Problem (DMP): Finds the best divergence angle for a known subset of bad scenarios.
  2. Adversarial Problem (AP): Acts as a "devil's advocate" to find a new drift scenario that makes the current divergence angle perform as poorly as possible.

Graph Theory as a Shortcut

A key innovation in this methodology is how the Adversarial Problem is solved. Because the underlying math involves complex integrals, the authors discretize the problem and map it to a Resource Constrained Shortest Path Problem (RCSPP) on a directed graph.

Figure 6: The discretization of the deviation over time slots, represented as a directed graph. This mapping allows the adversarial problem to be solved efficiently using graph-based algorithms.

This transformation allows them to use efficient graph-based algorithms to find the worst-case drift scenario in pseudo-polynomial time, making an otherwise intractable problem solvable for engineering applications.

Key Results and Insights

The model was evaluated using a high-fidelity simulation environment (40 km distance, 850 nm wavelength, 70 mW transmit power). Key findings include:

  • Superior Guarantees: The proposed Robust Angle (RA) scheme provided a 10% higher guaranteed sum rate compared to "Average-deviation" schemes.
  • Stability: In simulations of 1,000 random scenarios, the RA approach showed much tighter performance clusters. While other methods occasionally had "lucky" high-speed runs, they also suffered frequent failures where the rate plummeted. The RA approach remained consistently high.
  • Fast Convergence: The iterative algorithm is efficient, typically reaching the optimal solution in fewer than 10 iterations.

Conclusion and Future Work

This research demonstrates that distribution-free security is possible in ISLC. By defining the boundaries of possible movement rather than guessing at probabilities, engineers can guarantee link reliability. While this initial study focused on a 1D simplification of deviation, future work will explore 2D jitter and dynamic beam adjustment, where the transmitter changes its focus in real-time as it estimates the drift.

Summary updated

Abstract

Performance degradation due to target deviation by, for example, drift or jitter, presents a significant issue to inter-satellite laser communications. In particular, with periodic acquisition for positioning the satellite receiver, deviation may arise in the time period between two consecutive acquisition operations. One solution to mitigate the issue is to use a divergence angle at the transmitter being wider than that if the receiver position is perfectly known. However, as how the deviation would vary over time is generally very hard to predict or model, there is no clear clue for setting the divergence angle. We propose a robust optimization approach to the problem, with the advantage that no distribution of the deviation need to be modelled. Instead, a so-called uncertainty set (often defined in form of a convex set such as a polytope) is used, where each element represents a possible scenario, i.e., a sequence of deviation values over time. Robust optimization seeks the solution that maximizes the performance (e.g., sum rate) that can be guaranteed, no matter which scenario in the uncertainty set materializes. To solve the robust optimization problem, we deploy a process of alternately solving a decision maker's problem and an adversarial problem. The former optimizes the divergence angle for a subset of the uncertainty set, whereas the latter is used to explore if the subset needs to be augmented. Simulation results show the approach leads to significantly more robust performance than using the divergence angle as if there is no deviation, or other ad-hoc schemes.
BibTeX
@misc{yu2023robust,
  author = {Zhanwei Yu and Yi Zhao and Di Yuan},
  title = {{Robust Divergence Angle for Inter-satellite Laser Communications under Target Deviation Uncertainty}},
  year = {2023},
  eprint = {2306.13093},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2306.13093},
}
Figure