SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-337546"
 

Search: onr:"swepub:oai:DiVA.org:kth-337546" > Demand-Aware Onboar...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Abdu, Tedros Salih (author)

Demand-Aware Onboard Payload Processor Management for High Throughput NGSO Satellite Systems

  • Article/chapterEnglish2023

Publisher, publication year, extent ...

  • Institute of Electrical and Electronics Engineers (IEEE),2023
  • printrdacarrier

Numbers

  • 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

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Kisseleff, Steven (author)
  • Lagunas, Eva (author)
  • Grotz, Joel (author)
  • Chatzinotas, Symeon (author)
  • Ottersten, Björn,1961-Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg(Swepub:kth)u120hb53 (author)
  • Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg (creator_code:org_t)

Related titles

  • In:IEEE Transactions on Aerospace and Electronic Systems: Institute of Electrical and Electronics Engineers (IEEE), s. 1-180018-9251

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view