Proceedings of the 29th Minisymposium 2022
DOI: 10.3311/minisy2022-007
|View full text |Cite
|
Sign up to set email alerts
|

Heterogeneous Federated CubeSat System: Problems, Constraints and Capabilities

Abstract: Different arguments were being presented in the last decade about CubeSats and their applications. Some of them address wireless communication (5G and 6G technologies) trying to achieve better characteristics as coverage and connectivity.Some arrived with terms as IoST (Internet of Space Things), Internet of Satellites (IoSat), DSS (Distributed Space Systems), and FSS (Federated Satellite Systems).All of them aim to use Small/NanoSatellites as constellations/swarms is to provide specific services, share unused… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 6 publications
0
5
0
Order By: Relevance
“…In order to solve problem (16), we first characterize its convexity. To begin with, we first define the lower bound capacity amount required per cycle in which 𝜇 𝑏 (𝑡) is fixed by considering the following proposition.…”
Section: A Problem Convexity Characterizationmentioning
confidence: 99%
See 2 more Smart Citations
“…In order to solve problem (16), we first characterize its convexity. To begin with, we first define the lower bound capacity amount required per cycle in which 𝜇 𝑏 (𝑡) is fixed by considering the following proposition.…”
Section: A Problem Convexity Characterizationmentioning
confidence: 99%
“…where 𝛼 𝑏 𝑘,1 = max 𝑡 ∈Ω 𝑘 𝐿𝜆 𝑏 (𝑡)/𝑇 TS , 𝛼 𝑘,2 = max 𝑡 ∈Ω 𝑘 𝐿𝑔 −1 𝑄 max (1 − PBlk , 𝑡)/𝑇 TS , and 𝑔 −1 𝑄 max ( PBlk , 𝑡) is the inverse function of 𝑄 max 𝑛=0 𝑔 𝑛,𝑏 (𝑊 𝑏 𝑘 , 𝑡). Proof: The proof is given in Appendix A In the next move, based on the result of this proposition and the fact that ( 17) is a linear constraint, we state the convexity of problem (16) in the following theorem.…”
Section: A Problem Convexity Characterizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Assuming the same service rate (𝜇 𝑘 ) values for all beams and, the remaining parameters set as indicated in Table I, the blocking probability simulation results are compared to the analysis results to verify their agreement. By utilizing the arrival rate function and service rate values of 𝜇 𝑘 = [330, 420, 430, 400, 380, 390] ×10 3 chunks randomly selected for a medium beam utilization of 0.5 to 0.8 as in [25], and calculating the stochastic queue length as outlined in (14), the instantaneous blocking probabilities 𝑝 𝑏 (𝑡)'s of all beams is obtained. The average mean blocking probability of all beams, 𝐵 𝑏=1 𝑇 𝑡=1 𝑝 𝑏 (𝑡)/(𝑇 𝐵), presented in Fig.…”
Section: A Analysis and Simulation Comparisonmentioning
confidence: 99%
“…When renting the network resources from the IPs and allocating them to provide communication services to customers, the SPs have to cope with several challenges to maximize their profit [5], [12], [13]. Their business problems include (but are not limited to) capacity dimensioning to meet the irregular and unpredictable time-varying data traffic generated by heterogeneous apps/services, as well as managing the rented resource efficiently in both peak and off-peak periods to minimize expenses [14]. Maintaining or growing the customer base is another difficult task for both the IPs and SPs to maximize their revenue.…”
mentioning
confidence: 99%