2017/07/24 by Hang Ruan, Ruan, Hang, Rodrigo C. de Lamare +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1707.08189
7 pages, 2 figures. arXiv admin note: text overlap with arXiv:1707.00953
arxiv created 2017/07/24 · arxiv updated 2017/07/27
This paper presents joint maximum signal-to-interference-plus-noise ratio (MSINR) and relay selection algorithms for distributed beamforming. We propose a joint MSINR and restricted greedy search relay selection (RGSRS) algorithm with a total relay transmit power constraint that iteratively optimizes both the beamforming weights at the relays nodes, maximizing the SINR at the destination. Specifically, we devise a relay selection scheme that based on greedy search and compare it to other schemes like restricted random relay selection (RRRS) and restricted exhaustive search relay selection (RESRS). A complexity analysis is provided and simulation results show that the proposed joint MSINR and RGSRS algorithm achieves excellent bit error rate (BER) and SINR performances.