IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i6p971-d1612845.html
   My bibliography  Save this article

Low-Complexity Relay Selection for Full-Duplex Random Relay Networks

Author

Listed:
  • Jonghyun Bang

    (SK Telecom Co., Ltd., Seoul 04539, Republic of Korea)

  • Taehyoung Kim

    (School of Electrical Engineering, Kookmin University, Seoul 02707, Republic of Korea)

Abstract

Full-duplex relay networks have been studied to enhance network performance under the assumption that the number and positions of relay nodes are fixed. To account for the practical randomness in the number and locations of relays, this paper investigates full-duplex random relay networks (FDRRNs) where all nodes are randomly distributed following a Poisson point process (PPP) model. In addition, we propose a low-complexity relay selection algorithm that constructs the candidate relay set while considering the selection diversity gain. Our simulation results demonstrate that, rather than simply increasing the number of candidate relay nodes, selecting an appropriate candidate relay set can achieve significant performance enhancement without unnecessarily increasing system complexity.

Suggested Citation

  • Jonghyun Bang & Taehyoung Kim, 2025. "Low-Complexity Relay Selection for Full-Duplex Random Relay Networks," Mathematics, MDPI, vol. 13(6), pages 1-15, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:6:p:971-:d:1612845
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/6/971/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/6/971/
    Download Restriction: no
    ---><---

    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:jmathe:v:13:y:2025:i:6:p:971-:d:1612845. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.