Sökning: onr:"swepub:oai:DiVA.org:kth-337546" >
Demand-Aware Onboar...
-
Abdu, Tedros Salih
(författare)
Demand-Aware Onboard Payload Processor Management for High Throughput NGSO Satellite Systems
- Artikel/kapitelEngelska2023
Förlag, utgivningsår, omfång ...
-
Institute of Electrical and Electronics Engineers (IEEE),2023
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:kth-337546
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337546URI
-
https://doi.org/10.1109/TAES.2023.3245044DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
QC 20231009
-
High-Throughput Satellite (HTS) systems with digital payload technology have been identified as a key enabler to support 5G/6G high-data connectivity with wider coverage area. The satellite community has extensively explored resource allocation methods to achieve this target. Typically, these methods do not consider the intrinsic architecture of the flexible satellite digital payload, which consists of multiple processors responsible for receiving, processing, and transmitting the signals. This paper presents a demand-aware onboard processor management scheme for broadband Non-Geostationary (NGSO) satellites. In this context, we formulate an optimization problem to minimize the number of active on-board processors while meeting the system constraints and user requirements. As the problem is non-convex, we solve it in two steps. First, we transform the problem into demand-driven bandwidth allocation while fixing the number of processors. Second, using the bandwidth allocation solution, we determine the required number of processors with two methods: 1) sequential optimization with the Branch & Bound method and 2) Bin Packing with Next Fit, First Fit, and Best Fit methods. Finally, we demonstrate the proposed methods with extensive numerical results. It is shown that the Branch & Bound, Best Fit, and First Fit methods manage the processors better than the Next Fit method. Furthermore, Branch & Bound requires fewer processors than the above methods.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Kisseleff, Steven
(författare)
-
Lagunas, Eva
(författare)
-
Grotz, Joel
(författare)
-
Chatzinotas, Symeon
(författare)
-
Ottersten, Björn,1961-Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg(Swepub:kth)u120hb53
(författare)
-
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:IEEE Transactions on Aerospace and Electronic Systems: Institute of Electrical and Electronics Engineers (IEEE), s. 1-180018-9251
Internetlänk
Hitta via bibliotek
Till lärosätets databas