2021 IEEE Wireless Communications and Networking Conference (WCNC) 2021
DOI: 10.1109/wcnc49053.2021.9417300
|View full text |Cite
|
Sign up to set email alerts
|

Demand-based Scheduling for Precoded Multibeam High-Throughput Satellite Systems

Abstract: The growing demand for broadband applications has driven the satellite communication service providers to investigate High Throughput Satellite (HTS) solutions. While precoding has been identified as the most promising technique to boost the satellite spectral efficiency, new advanced solutions focus on re-configurable demand-driven systems, where throughput delivered aligns with the time and geographical variations of the traffic demand. For such goal, conventional user scheduling algorithms fail to meet the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 13 publications
(21 citation statements)
references
References 16 publications
0
21
0
Order By: Relevance
“…Note that this study focuses on the demand-matching at the beam level. The task to distribute the beam capacity to the different end-users of that beam is known as user scheduling (Guidotti and Vanelli-Coralli, 2020;Honnaiah et al, 2021).…”
Section: Objectivementioning
confidence: 99%
“…Note that this study focuses on the demand-matching at the beam level. The task to distribute the beam capacity to the different end-users of that beam is known as user scheduling (Guidotti and Vanelli-Coralli, 2020;Honnaiah et al, 2021).…”
Section: Objectivementioning
confidence: 99%
“…We stress that problem (11) is non-convex as a consequence of the discrete feasible domain and the non-convex objective function. Particularly, the discrete feasible domain makes (11) a combinatorial problem, where the global optimum can only be obtained for a small scale network with few users and small number of beams since an exhaustive search of the parameter space is required. Nevertheless, the exhaustive search has the computational complexity scaling up exponentially with the number of available users.…”
Section: A Problem Formulationmentioning
confidence: 99%
“…Remark 1. Problem (11) is a generalized version of the previous works [5], [11] and references therein since the N users are scheduled over different time slots and since we also take the QoS requirements into account. In other words, problem (11) ensures the scheduled users always satisfied their throughput demands.…”
Section: A Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations