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

Jonghyun Bang and Taehyoung Kim ()
Additional contact information
Jonghyun Bang: SK Telecom Co., Ltd., Seoul 04539, Republic of Korea
Taehyoung Kim: School of Electrical Engineering, Kookmin University, Seoul 02707, Republic of Korea

Mathematics, 2025, vol. 13, issue 6, 1-15

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.

Keywords: outage probability; random relay network; cooperative network; full duplex relay; relay selection diversity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/6/971/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/6/971/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:6:p:971-:d:1612845

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().