In this paper, a Low earth orbit (LEO) High-Throughput Satellite (HTS) Multi-User multiple-input multiple-output (MIMO) system is considered. With the objective of minimizing inter-beam interference among users, we propose a joint graph-based user scheduling and feed space beamforming framework for the downlink. First, we construct a graph where the vertices are the users and edges are based on a dissimilarity measure of their channels. Secondly, we design a low complexity greedy user clustering strategy, in which we iteratively search for the maximum clique in the graph. Finally, a Minimum Mean Square Error (MMSE) beamforming matrix is applied on a cluster basis with different power normalization schemes. A heuristic optimization of the graph density, i.e., optimal cluster size, is performed in order to maximize the system capacity. The proposed scheduling algorithm is compared with a position-based scheduler, in which a beam lattice is generated on ground and one user per beam is randomly selected to form a cluster. Results are presented in terms of achievable per-user capacity and show the superiority in performance of the proposed scheduler w.r.t. to the position-based approach.

Joint Graph-based User Scheduling and Beamforming in LEO-MIMO Satellite Communication Systems / Riviello, D. G.; Ahmad, B.; Guidotti, A.; Vanelli-Coralli, A.. - ELETTRONICO. - (2022), pp. 1-8. (Intervento presentato al convegno 2022 11th Advanced Satellite Multimedia Systems Conference and the 17th Signal Processing for Space Communications Workshop, ASMS/SPSC 2022 tenutosi a Graz (Austria) nel 6-8 Settembre 2022) [10.1109/ASMS/SPSC55670.2022.9914723].

Joint Graph-based User Scheduling and Beamforming in LEO-MIMO Satellite Communication Systems

Riviello D. G.;
2022

Abstract

In this paper, a Low earth orbit (LEO) High-Throughput Satellite (HTS) Multi-User multiple-input multiple-output (MIMO) system is considered. With the objective of minimizing inter-beam interference among users, we propose a joint graph-based user scheduling and feed space beamforming framework for the downlink. First, we construct a graph where the vertices are the users and edges are based on a dissimilarity measure of their channels. Secondly, we design a low complexity greedy user clustering strategy, in which we iteratively search for the maximum clique in the graph. Finally, a Minimum Mean Square Error (MMSE) beamforming matrix is applied on a cluster basis with different power normalization schemes. A heuristic optimization of the graph density, i.e., optimal cluster size, is performed in order to maximize the system capacity. The proposed scheduling algorithm is compared with a position-based scheduler, in which a beam lattice is generated on ground and one user per beam is randomly selected to form a cluster. Results are presented in terms of achievable per-user capacity and show the superiority in performance of the proposed scheduler w.r.t. to the position-based approach.
File in questo prodotto:
File Dimensione Formato  
ASMS_2022_Bilal.pdf

non disponibili

Descrizione: published
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 879.07 kB
Formato Adobe PDF
879.07 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Joint Graph-based User Scheduling and Beamforming in LEO-MIMO Satellite Communication Systems.pdf

accesso aperto

Descrizione: accepted_paper
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 1.62 MB
Formato Adobe PDF
1.62 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2975291