IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v14y2022i10p286-d930309.html
   My bibliography  Save this article

Minimization of n th Order Rate Matching in Satellite Networks with One to Many Pairings

Author

Listed:
  • Anargyros J. Roumeliotis

    (School of Electrical and Computer Engineering, National Technical University of Athens, GR-157 80 Athens, Greece)

  • Christos N. Efrem

    (School of Electrical and Computer Engineering, National Technical University of Athens, GR-157 80 Athens, Greece)

  • Athanasios D. Panagopoulos

    (School of Electrical and Computer Engineering, National Technical University of Athens, GR-157 80 Athens, Greece)

Abstract

This paper studies the minimization of n th (positive integer) order rate matching in high-throughput multi-beam satellite systems, based on one-to-many capacity allocation pairings, for the first time in the literature. The offered and requested capacities of gateways and users’ beams are exploited, respectively. Due to the high complexity of the binary optimization problem, its solution is approached with a two-step heuristic scheme. Firstly, the corresponding continuous, in [0, 1], pairing problem is solved applying the difference of convex optimization theory, and then, a transformation from continuous to binary feasible allocation is provided to extract the pairings among gateways and users’ beams. Comparing with the exponential-time optimal exhaustive mechanism that investigates all possible pairs to extract the best matching for minimizing the rate matching, extended simulations show that the presented approximation for the solution of the non-convex optimization problem has fast convergence and achieves a generally low relative error for lower value of n . Finally, the simulation results show the importance of n in the examined problem. Specifically, pairings originated by the minimization of rate matching with larger n result in more fair rate matching among users’ beams, which is a valuable result for satellite and generally wireless systems operators.

Suggested Citation

  • Anargyros J. Roumeliotis & Christos N. Efrem & Athanasios D. Panagopoulos, 2022. "Minimization of n th Order Rate Matching in Satellite Networks with One to Many Pairings," Future Internet, MDPI, vol. 14(10), pages 1-11, September.
    • Handle: RePEc:gam:jftint:v:14:y:2022:i:10:p:286-:d:930309
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/10/286/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/14/10/286/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Francesco Chiti & Romano Fantacci & Laura Pierucci, 2019. "Energy Efficient Communications for Reliable IoT Multicast 5G/Satellite Services," Future Internet, MDPI, vol. 11(8), pages 1-13, July.
    2. Georgios A. Karagiannis & Athanasios D. Panagopoulos, 2019. "Dynamic Lognormal Shadowing Framework for the Performance Evaluation of Next Generation Cellular Systems," Future Internet, MDPI, vol. 11(5), pages 1-18, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Michele Bonanni & Francesco Chiti & Romano Fantacci & Laura Pierucci, 2021. "Dynamic Control Architecture Based on Software Defined Networking for the Internet of Things," Future Internet, MDPI, vol. 13(5), pages 1-15, April.
    2. Omar Abu Ella & Mohammed Elmusrati, 2022. "Achievable rate approximation for massive MIMO with limited number of interfering clients," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(4), pages 463-479, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:14:y:2022:i:10:p:286-:d:930309. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.