JOURNAL ARTICLE

A low-complexity algorithm for constrained optimal relay node placement in wireless cooperative networks

Abstract

Cooperative communication (CC) technology has emerged as a hot issue in wireless communication nowadays. Cooperative diversity has showed the significant effects on enhancing the system capacity, mitigating the bit error rate caused by the Rayleigh fading channel and improving the quality of the communication system. Based on the previous researches on problem of the relay node placement (RNP), this paper puts forward a CC-RNP algorithm of low complexity on the RNP problem. We also formulate the optimizing problems and utilizing the Genetic Algorithm to achieve the maximum capacity between two nodes in a constrained area. Numerical result demonstrates that the proposed low-complexity algorithm can perform as well as the scheme proposed in the previous work.

Keywords:
Relay Computer science Rayleigh fading Node (physics) Wireless Channel (broadcasting) Bit error rate Fading Computational complexity theory Computer network Cooperative diversity Algorithm Genetic algorithm Wireless network Telecommunications Engineering

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.08
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced MIMO Systems Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Wireless Communication Security Techniques
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.