Optimization of Horizon-Wide JANUS Attack Planning

Optimize the horizon-planning method for JANUS attacks so that it improves attack success rate and cumulative victim-service degradation across the complete multi-window attack horizon while accounting for temporal dependencies between successive beam-hopping decisions.

Background

JANUS supports horizon planning, in which attacker-generated traffic is jointly selected across multiple beam-hopping decision windows while accounting for how earlier traffic and scheduling outcomes affect later windows. In the reported experiments, horizon planning achieved lower attack success rates than iterative planning but produced greater throughput degradation by optimizing cumulative impact over the full horizon.

The paper explicitly identifies further optimization of this horizon-wide planning method as unresolved, indicating that the presented procedure is a feasibility demonstration rather than a final optimization approach.

References

These results demonstrate the feasibility of horizon-wide attack planning, and we leave further optimization of this method for future work.

— JANUS: Denial-of-Service Attack Against Beam Hopping in LEO Satellite Networks  (2609.19977 - Aviv et al., 17 Sep 2026) in Section 5.2, “Continuous Denial and Service Degradation”