A distributed algorithm for cooperative relay beamforming

Journal Article

We consider the problem of cooperative beamforming in relay networks. Assuming knowledge of the second-order statistics of channel state information (CSI), the optimal beamforming weights are determined so that the total transmitted power at the relays is minimized, while meeting signal-to- interference-plus-noise-ratio (SINR) requirements at the destinations. Our formulation utilizes the Semidefinite Relaxation (SDR) technique to produce an efficient, tractable convex programming approximation of the problem in centralized form. We propose a distributed optimization algorithm to calculate the optimal beamforming weights for scenarios where multiple clusters of source-destination node pairs, along with their dedicated relays, coexist in space. Our method relies on dual decomposition techniques with regularization, that can significantly improve on the inherent disadvantages of simple dual subgradient methods. Numerical anaysis demonstrates that the proposed algorithm exhibits very fast convergence rates. © 2013 AACC American Automatic Control Council.

Duke Authors

Cited Authors

  • Chatzipanagiotis, N; Petropulu, A; Zavlanos, MM

Published Date

  • September 11, 2013

Published In

Start / End Page

  • 3796 - 3801

International Standard Serial Number (ISSN)

  • 0743-1619

Citation Source

  • Scopus