Loading…
Dynamic Capacity Allocation in Smart Gateway High Throughput Satellite Systems Using Matching Theory
In this paper, the performance of multibeam high throughput satellite systems, which employ the smart gateway diversity concept, is investigated and various capacity allocation schemes are examined. These satellite systems operate at high frequencies above 20 GHz. To study the system's capacity...
Saved in:
Published in: | IEEE systems journal 2019-06, Vol.13 (2), p.2001-2009 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, the performance of multibeam high throughput satellite systems, which employ the smart gateway diversity concept, is investigated and various capacity allocation schemes are examined. These satellite systems operate at high frequencies above 20 GHz. To study the system's capacity losses, the impact of the total atmospheric attenuation is incorporated and a novel flexible dynamic capacity allocation scheme is proposed based on the offered capacities of gateways and requested capacities of users' beams. Specifically, the system's capacity losses, which constitute the system's performance metric, are determined as the summation of difference among the requested and offered capacities of paired user beams and gateways when this difference is positive. The proposed allocation scheme has low complexity, and its resource allocation algorithm is based on the fundamentals of matching theory, implemented in realistic scenarios where each gateway serves one or more users' beams simultaneously. The proposed scheme has the same performance with the highly complex Exhaustive algorithm that estimates all possible matching combinations between gateways and users' beams to find the minimum capacity losses. It is finally compared in terms of system's capacity losses with three other schemes, namely, the Fairness mechanism, a less complicated Fixed mechanism and a naive Random mechanism. The proposed scheme is better than the Fairness method in smaller probabilities and generally outperforms both the Fixed and Random methods. |
---|---|
ISSN: | 1932-8184 1937-9234 |
DOI: | 10.1109/JSYST.2018.2852059 |