Secrecy rate maximization for information and energy transfer in MIMO beamforming networks
Consider a multiple-input multiple-output (MIMO) beamforming system, where a multi-antenna base station transmits information and energy simultaneously to a multi-antenna information receiver (IR) and a number of multi-antenna energy receivers (ERs). The ERs are assumed to possess dual functionality...
Saved in:
| Published in: | Conference record - Asilomar Conference on Signals, Systems, & Computers pp. 1989 - 1993 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.11.2014
|
| Subjects: | |
| ISSN: | 1058-6393 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Consider a multiple-input multiple-output (MIMO) beamforming system, where a multi-antenna base station transmits information and energy simultaneously to a multi-antenna information receiver (IR) and a number of multi-antenna energy receivers (ERs). The ERs are assumed to possess dual functionality such that they can also decode information. This gives rise to the physical layer security issue of providing confidential information to the IR while ensuring efficient energy harvesting for the ERs. Hence, we employ an artificial noise (AN)-aided secrecy approach at the transmitter, where the AN improves the security by interfering with the information decoding at the ERs while, at the same time, providing them with wireless energy to harvest. In this paper, we address the problem of jointly optimizing the beamforming matrix for the IR and the covariance matrix of the AN such that the secrecy rate is maximized subject to energy harvesting constraints and a total power constraint. The corresponding optimization problem is a difference of convex functions (DC) programming problem, which is generally non-convex. Nevertheless, we propose an alternating optimization (AO) strategy to tackle this problem for the cases of a square and a non-square IR channel. The performance of the proposed algorithms is demonstrated by simulation results. |
|---|---|
| ISSN: | 1058-6393 |
| DOI: | 10.1109/ACSSC.2014.7094819 |