Computationally efficient relay-source antenna selection for MIMO two-way relay networks

In this paper, we study the open-challenging problem of antenna selection (AS) at both the relay and source nodes in MIMO two-way relay networks (TWRNs). Two near-optimal algorithms, namely the joint relay-source AS (JRSAS) and the separated relay-source AS (SRSAS), are proposed in a greedy manner. Specially, JRSAS selects antennas at both the relay and source nodes simultaneously in each AS step to maximize the increment of the system throughput. In order to further reduce the AS computational complexity, SRSAS performs AS at the relay and source nodes in two separate stages. Numerical results show that both JRSAS and SRSAS can approach the optimal exhaustive search (ES) AS algorithm but the computational complexity has been significantly reduced.