BROWSE
Detail
Journal Article
Near-Optimal Beam Placement With Low Complexity for Multicast Services in LEO Satellite Networks
Cited 0 time in 
Share 
Share
- Authors
- Satya Chan, Hee Wook Kim, Daesub Oh, Bonjun Ku, Sooyoung Kim
- Issue Date
- 2025-06
- Citation
- IEEE Communications Letters, v.29, no.6, pp.1335-1339
- ISSN
- 1089-7798
- Publisher
- IEEE
- Language
- English
- Type
- Journal Article
- Abstract
- Low-Earth Orbit (LEO) satellite constellations are transforming global communication by providing low-latency and consistent coverage. A critical challenge in LEO systems lies in optimizing beam placement to maximize the minimum bit rate for ground nodes (GNs), particularly for multicast services. This study addresses the computational complexity of existing geometry-based beam placement methods, limiting their scalability. We propose a novel solution that adapts Welzl’s algorithm for beam placement application, and introduces a linear center estimation method based on Taylor series-based approximations. Simulation results demonstrate that our approach achieves near-optimal solutions with significantly reducing complexity, making it well-suited for large-scale LEO satellite networks.
- KSP Keywords
- Bit rate, Computational complexity, Geometry-based, Global communication, LEO satellite networks, Low complexity, Low latency, Multicast services, Near optimal solution, Satellite constellations, Taylor Series