JOURNAL ARTICLE

Interference-aware relay selection for multiple source-destination cooperative networks

Abstract

We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.

Keywords:
Relay Computer science Interference (communication) Selection (genetic algorithm) Metric (unit) Throughput Transmission (telecommunications) Performance metric Computer network Matching (statistics) Relay channel Mathematical optimization Telecommunications Wireless Engineering Mathematics Channel (broadcasting) Artificial intelligence

Metrics

14
Cited By
1.37
FWCI (Field Weighted Citation Impact)
14
Refs
0.84
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Full-Duplex Wireless Communications
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Advanced Wireless Communication Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.