Abstract
This paper investigates distributed beamforming (DBF) designs for two-way relay networks (TWRNs), where two terminal nodes exchange information through a set of amplify-and-forward (AF) relays. We assume individual relay power constraints and study two important design problems, namely, the max–min fairness (MMF) problem and the weighted sum-rate maximization (WSRM) problem. For the MMF problem, unlike the existing works that usually solve the problem by a bisection method, we propose an efficient optimal solution by solving one convex second-order cone program (SOCP) only. For the WSRM problem, we develop an efficient iterative algorithm based on SOCP reformulation and the successive convex approximation (SCA) technique. For both the MMF and WSRM designs, we further propose a distributed implementation framework where each of the relays can independently compute its beamforming weight using its local channel state information (CSI) and some common parameters broadcasted by a control center. Simulation results are presented to demonstrate the performance advantages of the proposed solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
