Strategy of Multi-Beam Spot Allocation for GEO Data Relay Satellite Based on Modified K-Means Algorithm

Huiliang Liu, Yao Chu, Yulong Zhang, Weiguo Hou, Yinqiao Li, Yuan Yao and Yaxing Cai
Additional contact information
Huiliang Liu: Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing 100094, China
Yao Chu: Department of Precision Instrument, Tsinghua University, Beijing 100084, China
Yulong Zhang: School of Integrated Circuits, Tsinghua University, Beijing 100084, China
Weiguo Hou: Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing 100094, China
Yinqiao Li: Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing 100094, China
Yuan Yao: Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing 100094, China
Yaxing Cai: Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing 100094, China

Mathematics, 2021, vol. 9, issue 15, 1-16

Abstract: With the booming development of satellite applications, the giant constellations of low Earth orbit (LEO) satellites have introduced challenges for the data relay service. The multi-beam satellite not only offers concurrent access to a large number of objects, but can also meet the high data requirements toward specific coverage of the LEO constellation. However, the multi-beam satellite often faces the mismatch problem of spot allocation and data requirements, which can cause an overload traffic jam or a waste of resources. An optimization algorithm on spot beam allocation is necessary to automatically place the spot centers with appropriate beam widths in line with the density of the traffic demands and to realize the uniformity of the beam occupation. Compared with the conventional K-means algorithm, two adjustable parameters ? and ? are introduced: one for tuning the ratio of two components making up the distance matrix, and the other for setting the obligatory minimum number of objects per beam. In this paper, the whole process of the proposed method is demonstrated, including the establishment of the low-orbit satellite constellation model, the extraction of the distribution features, and the implementation and evaluation of the modified K-means algorithm. The results prove the validity of the proposed algorithm. A larger value of ? with a relative smaller value of ? tends to obtain the uniformity of beam occupation; the minimum standard deviation of objects per beam is achieved when ? is 0.2 and ? is 0.8. This demonstrates that the uniformity of objects per beam can be realized by adjusting the parameters of the distance determination matrix and the obligatory minimal number of objects in each beam. The impact of parameter range on the results is also analyzed.

Keywords: data relay service; multi-beam satellite; beam spot allocation; modified K-means (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/15/1718/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/15/1718/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:15:p:1718-:d:598668

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().