Reference : Combining Time-Flexible Satellite Payload with Precoding: The Cluster Hopping Approach
Scientific journals : Article
Engineering, computing & technology : Electrical & electronics engineering
Security, Reliability and Trust
http://hdl.handle.net/10993/53361
Combining Time-Flexible Satellite Payload with Precoding: The Cluster Hopping Approach
English
Gupta, Vaibhav Kumar mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Ha, Vu Nguyen mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Lagunas, Eva mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Al-Hraishawi, Hayder mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Chen, Lin mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Chatzinotas, Symeon mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
2022
IEEE Transactions on Vehicular Technology
Yes
International
0018-9545
[en] Very High Throughput Satellite System ; Beam Hopping ; Cluster Hopping ; Precoding ; Demand Satisfaction
[en] High throughput geostationary (GEO) satellite systems are characterized by a multi-beam wide coverage. However,
developing efficient resource management mechanisms to meet
the heterogeneous user traffic demands remains an open challenge for satellite operators. Furthermore, the spectrum shortage
and the ever increasing demands claim for more aggressive
frequency reuse. In this paper, we combine the time-flexible
payload capabilities known as beam hopping (BH) with precoding
techniques in order to satisfy user traffic requests in areas of high
demand (i.e. hot-spot areas). The proposed framework considers
a flexible beam-cluster hopping where adjacent beams can be
activated if needed, forming clusters with various shapes and
sizes. In this context, we present three strategies to design the
beam illumination patterns. First, a max-min user demand fairness satisfaction problem; second, a penalty-based optimization
is considered to penalize the occurrence of adjacent beams in an
attempt to avoid precoding whenever possible. Third, seeking a
low-complexity design, we propose a queuing-based approach
to solve the problem in a time-slot by time-slot basis trying
to provide service to users based on the requested demands.
The three methods are discussed in detailed and evaluated
via numerical simulations, confirming their effectiveness versus
benchmark schemes and identifying the pros and cons of each
proposed design.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Other
Fonds National de la Recherche - FnR
FlexSAT, DISBuS, FlexPreDem
Researchers
http://hdl.handle.net/10993/53361

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
IEEE TVT paper.pdfPublisher postprint1.27 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.