2013
DOI: 10.1109/lcomm.2012.121912.122144
|View full text |Cite
|
Sign up to set email alerts
|

Robust Peer-to-Peer Relay Beamforming: A Probabilistic Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 8 publications
0
16
0
Order By: Relevance
“…The method in [9] is named as SDR(Semi-Definite Relaxation) ,our proposed method shown in (17) is named as LPM(Lorentz-Positive Map). In the simulations, we compare the performance of these two methods as well as with the perfect CSI case.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The method in [9] is named as SDR(Semi-Definite Relaxation) ,our proposed method shown in (17) is named as LPM(Lorentz-Positive Map). In the simulations, we compare the performance of these two methods as well as with the perfect CSI case.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…However, in most scenarios encountered the channels observed by the relays may lead to performance degradation because of inevitable measurements, estimation procedures and quantization errors in CSI [15] as well as propagation effects. These impairments result in imperfect CSI that can affect most distributed beamforming methods, which either fail to work properly or cannot provide satisfactory performance.…”
Section: A Prior and Related Workmentioning
confidence: 99%
“…In this context, robust distributed beamforming (RDB) techniques are hence in demand to mitigate the channel errors or uncertainties and preserve the relay system performance. The studies in [15], [16], [17], [18] minimize the total relay transmit power under an overall quality of service (QoS) constraint, using either a convex semi-definite programme (SDP) relaxation method or a convex second-order cone programme (SOCP). The works in [15], [16] consider the channel errors as Gaussian random vectors with known statistical distributions between the source to the relay nodes and the relay nodes to the destination, whereas [17] models the channel errors on their covariance matrices as a type of matrix perturbation.…”
Section: A Prior and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…One approach is to consider the worst-case based optimization that restricts the channel errors in a certain bounded region [4][5][6] . Another approach is the probabilistic approach, in which QoS is guaranteed in a probabilistic sense [7,8] . The first approach usually employs semi-definite programming relaxation to tackle the problem of infinite constraints due to CSI errors, which can not guarantee a rank-one optimal solution.…”
Section: Introductionmentioning
confidence: 99%