Robust peer-to-peer relay beamforming: A probabilistic approach

Dhananjaya Ponukumati*, Feifei Gao, Chengwen Xing

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

Abstract

In this work, we design outage constrained collaborative relay beamforming (CRBF) vectors for a peer-to-peer amplify-and-forward (AF) relay network with imperfect channel state information (CSI) at the relays. Specifically, we model channel estimation error as a Gaussian random vector with known statistical distribution. The objective is to minimize the total transmit power at relays subject to probabilistic quality of service (QoS) constraints at each receiver. To solve the original non-convex problem, we utilize Bernstein-type inequalities and recast the original probabilistic constraints into conservative deterministic linear matrix inequalities (LMI). An alternative method is to replace the probabilistic constraint with a conservative one by applying S-procedure. Employing rank relaxation technique, the two convex reformulations are numerically solved with semidefinite programming (SDP). Simulation results are provided to corroborate our studies.

Original languageEnglish
Article number6400343
Pages (from-to)305-308
Number of pages4
JournalIEEE Communications Letters
Volume17
Issue number2
DOIs
Publication statusPublished - 2013

Keywords

  • Distributed beamforming
  • outage probability
  • peer-to-peer
  • semidefinite programming

Fingerprint

Dive into the research topics of 'Robust peer-to-peer relay beamforming: A probabilistic approach'. Together they form a unique fingerprint.

Cite this