Beam Management in Low Earth Orbit Satellite Networks with Random Traffic Arrival and Time-varying Topology
Abstract: Low earth orbit (LEO) satellite communication networks have been considered as promising solutions to providing high data rate and seamless coverage, where satellite beam management plays a key role. However, due to the limitation of beam resource, dynamic network topology, beam spectrum reuse, time-varying traffic arrival and service continuity requirement, it is challenging to effectively allocate time-frequency resource of satellite beams to multiple cells. In this paper, aiming at reducing time-averaged beam revisit time and mitigate inter-satellite handover, a beam management problem is formulated for dynamic LEO satellite communication networks, under inter-cell interference and network stability constraints. Particularly, inter-cell interference constraints are further simplified into off-axis angle based constraints, which provide tractable rules for spectrum sharing between two beam cells. To deal with the long-term performance optimization, the primal problem is transformed into a series of single epoch problems by adopting Lyapunov optimization framework. Since the transformed problem is NP-hard, it is further divided into three subproblems, including serving beam allocation, beam service time allocation and serving satellite allocation. With the help of conflict graphs built with off-axis angle based constraints, serving beam allocation and beam service time allocation algorithms are developed to reduce beam revisit time and cell packet queue length. Then, we further develop a satellite-cell service relationship optimization algorithm to better adapt to dynamic network topology. Compared with baselines, numerical results show that our proposal can reduce average beam revisit time by 20.8% and keep strong network stability with similar inter-satellite handover frequency.
- T. Ram rez, C. Mosquera and N. Alagha, “Flexible user mapping for radio resource assignment in advanced satellite payloads,” IEEE Trans. Broadcast., vol. 68, no. 3, pp. 723-739, Sep. 2022.
- P. K. Chowdhury, M. Atiquzzaman and W. Ivancic, “Handover schemes in satellite networks: State-of-the-art and future research directions,” IEEE Commun. Surveys Tuts., vol. 8, no. 4, pp. 2-14, Fourth Quarter 2006.
- 3GPP, “Study on new radio (NR) to support non terrestrial networks,” 3GPP, Technical Report 38.811, v15.4.0, 2020.
- “Reference radiation pattern of earth station antennas in the fixed-satellite service for use in coordination and interference assessment in the frequency range from 2 to 31 GHz,” Int. Telecommun. Union, Geneva, Switzerland, ITU-Recommendation S.465, 2020.
- H. L. Van Trees, “Optimum array processing: Part IV of detection, estimation, and modulation theory,” New York, NY, USA: Wiley-Interscience, 2002.
- F.-I. Tseng and D. K. Cheng, “Optimum scannable planar arrays with an invariant sidelobe level,” in Proc. IEEE, Nov. 1968, pp. 1771-1778.
- “Propagation data and prediction methods required for the design of Earth-space telecommunication systems,” Int. Telecommun. Union, Geneva, Switzerland, ITU-Recommendation P.618, 2017.
- M. Neely, “Stochastic network optimization with application to communication and queueing systems,” Synth. Lectures Commun. Netw., vol. 3, no. 1, pp. 1-211, 2010.
- M. J. Neely, “Dynamic optimization and learning for renewal systems,” IEEE Trans. Autom., vol. 58, no. 1, pp. 32-46, Jan. 2013.
- Y. Ren and V. Friderikos, “Interference aware path planning for mobile robots in mmWave multi cell networks,” in Proc. 2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall), London, United Kingdom, Sep. 2022, pp. 1-6.
- M. S. Al-Abiad and M. J. Hossain, “Coordinated scheduling and decentralized federated learning using conflict clustering graphs in fog-assisted IoD networks,” IEEE Trans. Veh. Technol., vol. 72, no. 3, pp. 3455-3472, Mar. 2023.
- H. Al-Hraishawi, E. Lagunas and S. Chatzinotas, “Traffic simulator for multibeam satellite communication systems,” in Proc. ASMS/SPSC Workshop, Graz, Austria, 2020, pp. 1-8.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.