Early View
ORIGINAL PAPER

Beam Management for Interference Mitigation in GEO-LEO Satellite Networks With Precoding

Xing Xin

Xing Xin

School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China

Search for more papers by this author
Gaofeng Cui

Corresponding Author

Gaofeng Cui

School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China

Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing, China

Correspondence:

Gaofeng Cui ([email protected])

Search for more papers by this author
Weidong Wang

Weidong Wang

School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China

Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing, China

Search for more papers by this author
First published: 10 June 2025
Funding: This research was supported by the National Natural Science Foundation of China, grant/award numbers: 62171052 and 61971054; and the Fundamental Research Funds for the Central Universities, grant/award number: 24820232023YQTD01.

ABSTRACT

Spectrum scarcity can be effectively mitigated through spectrum sharing between LEO and GEO satellites. However, severe interbeam interference may be caused by the dense distribution and wide coverage of multilayer satellite systems. Furthermore, the uneven distribution of traffic demand generated by users may lead to load imbalance among satellites, by which service fairness may be degraded. In this paper, beam management and precoding design are investigated in GEO-LEO coexistence networks to mitigate interbeam interference and improve service fairness in multi-layer satellite systems. To solve the load imbalance problem, a serving satellite allocation algorithm based on game matching theory is proposed. Moreover, a heuristic-based joint beam management and precoding algorithm is proposed to mitigate interference and enhance service fairness. Simulation results show the effectiveness of the proposed algorithms.

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.