A New Method for Robust Multiple Peer-To-Peer Relay Beamforming

DOI

10.2991/icitmi-15.2015.116How to use a DOI?

Keywords

relay network; robust beamforming; channel state information; transmit power; semi-definite relaxation

Abstract

This paper focuses on how to design the robust beamforming vectors of multiple peer-to-peer relay networks. In the context of imperfect channel state information at the relays, our goal is to minimize the transmit power at relay nodes subject to the quality of service at each receiver. A method based on real value Lorentz-positive maps and linear matrix inequalities is proposed, which converts the transmit power minimization problem at relay nodes into a convex optimization problem. The proposed method overcomes the disadvantages of traditional methods based on semi-definite programming relaxation, which sometimes result in solutions with rank greater than one. Simulation results show that the solution of the proposed method is consistent with those of conventional method based on semi-definite programming relaxation.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yunshan Hou
AU  - Junyi Du
AU  - Zhijuan Qi
AU  - Jianhua Chen
PY  - 2015/10
DA  - 2015/10
TI  - A New Method for Robust Multiple Peer-To-Peer Relay Beamforming
BT  - Proceedings of the 4th International Conference on Information Technology and Management Innovation
PB  - Atlantis Press
SP  - 695
EP  - 700
SN  - 2352-538X
UR  - https://doi.org/10.2991/icitmi-15.2015.116
DO  - 10.2991/icitmi-15.2015.116
ID  - Hou2015/10
ER  -