Location-Based Relay Selection in Full-Duplex Random Relay Networks

Full-duplex relay (FDR) has attracted considerable interest in enhancing the performance of relay networks by utilizing resources more efficiently. In this paper, we propose a framework for full-duplex random relay networks (FDRRNs), where relay nodes equipped with full-duplex (FD) capability are randomly distributed within a finite two-dimensional region. We first derive the outage probability of an FDRRN and then identify the potential relay location that minimizes the outage probability. Furthermore, we introduce a low-complexity relay selection algorithm that selects the relay node nearest to the potential relay location. Finally, simulation results show that the proposed relay selection algorithm achieves performance comparable to that of the max-min relay selection algorithm.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2024-11-18
DOI
https://doi.org/10.3390/app142210626
Citations
2
Primary Topic
Full-Duplex Wireless Communications
Type
article
Field-Weighted Citation Impact
0.42

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Location-Based Relay Selection in Full-Duplex Random Relay Networks

Taehyoung Kim, Jonghyun Bang
2 citations
Applied Sciences
Full-Duplex Wireless Communications
0.42
article

Location-Based Relay Selection in Full-Duplex Random Relay Networks

Taehyoung Kim, Jonghyun Bang
article en
2 citations

Abstract

Full-duplex relay (FDR) has attracted considerable interest in enhancing the performance of relay networks by utilizing resources more efficiently. In this paper, we propose a framework for full-duplex random relay networks (FDRRNs), where relay nodes equipped with full-duplex (FD) capability are randomly distributed within a finite two-dimensional region. We first derive the outage probability of an FDRRN and then identify the potential relay location that minimizes the outage probability. Furthermore, we introduce a low-complexity relay selection algorithm that selects the relay node nearest to the potential relay location. Finally, simulation results show that the proposed relay selection algorithm achieves performance comparable to that of the max-min relay selection algorithm.

Applied SciencesVol. 14(22)
Kookmin University (KR)
Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion
Openalex Percentile: Top 37%
Full-Duplex Wireless Communications
0.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.