MIMO SWIPT系统安全波束成形优化策略

PDF格式 | 449KB | 更新于2024-08-26 | 43 浏览量 | 举报

"该文研究了保密MIMO(Secure MIMO)系统中同时无线信息与功率传输(SWIPT)的安全波束成形设计，旨在在保证秘密通信速率要求的同时，最大化多个能量采集接收器的最小能量收获。文中提出了一种逐次凸逼近(Sequential Convex Approximation, SCA)迭代算法，以解决半定义规划问题，以在完美信道状态信息(CSI)条件下获得接近最优的秩一解。此外，还扩展了该问题到不完美CSI情况，引入范数有界误差模型，并提出了基于SCA的迭代算法。仿真结果表明，SCA迭代算法在性能上与半定义放松方法相当。" 在保密MIMO SWIPT系统中，安全波束成形设计是一项关键的技术，其目的是在确保通信的机密性的同时，利用无线信号传输信息并为接收设备供电。这种技术结合了多输入多输出(MIMO)通信的优势，如空间复用和分集增益，以及SWIPT技术，允许接收端在接收信息的同时收集能量。本文探讨了一个具有多个能量采集接收器的保密多址通道，这些接收器可能具有不同的能量收获能力。为了确保公平性，研究的目标是在满足秘密率要求的前提下，最大化所有接收器中的最小能量收获量。这涉及到优化波束成形向量的设计，以同时增强目标接收器的信息传输和能量收集，同时尽可能地减少潜在的窃听者接收到的信息。在完美CSI的假设下，半定义规划问题被用来解决这一挑战。然而，半定义规划通常具有较高的计算复杂度，因此作者提出了一个SCA迭代算法，它通过每次迭代逐步逼近最优解，有效地降低了计算复杂度。这种方法可以产生接近最优的秩一解决方案，从而在保证系统性能的同时，简化了实际系统的实现。进一步，文章考虑了现实场景中的不完美CSI情况。由于实际信道估计总是存在误差，文章引入了范数有界误差模型来描述这种不确定性。针对这种情况，也开发了一种基于SCA的迭代算法，以适应这种环境下的波束成形设计。通过仿真，作者证明了基于SCA的迭代算法在性能上与半定义放松方法相当，这表明该算法在实际应用中是可行且高效的。这些发现对于提升保密MIMO SWIPT系统的安全性、效率和公平性具有重要的理论和实践意义，为未来无线通信网络的设计提供了新的思路和技术支持。

424 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 7, NO. 3, JUNE 2018

Secure Beamforming Designs for Secrecy MIMO SWIPT Systems

Zhengyu Zhu , Zheng Chu , Fuhui Zhou , Hehao Niu, Zhongyong Wang ,andInkyuLee , Fellow, IEEE

Abstract—In this letter, secure beamforming designs are

investigated in a multiple-input multiple-output secrecy chan-

nels with simultaneous wireless information and power transfer.

In order to achieve fairness among different multiple energy

harvesting receivers, the minimum harvested energy is maxi-

mized under the secrecy rate requirements. In particular, in

order to reduce the computational complexity of the semideﬁ-

nite programming problem, a successive convex approximation

(SCA) iterative algorithm is proposed in the perfect channel state

information (CSI) case to obtain a near-optimal rank-one solu-

tion. Moreover, the original problem is extended to the imperfect

CSI case by incorporating a norm-bounded error model, where

an SCA-based iterative algorithm is also proposed. Simulation

results reveal that the SCA-based iterative algorithm achieves

the same performance as the semideﬁnite relaxation method with

reduced complexity.

Index Terms—SWIPT, MIMO system, secure beamforming,

successive convex approximation, semideﬁnite relaxation.

I. INTRODUCTION

IMULTANEOUS wireless information and power transfer

(SWIPT) which harvests energy for wireless devices and

increases the durability of wireless networks [1]. Meanwhile,

because of the openness of wireless networks, the informa-

tion security is a key issue for SWIPT system. Physical-layer

security (PLS), has become more crucial in 5G wireless

networks to increase the security of wireless channels [2]–[5].

Moreover, PLS has recently been pursued in different SWIPT

systems, such as relay network [6], multiple-input-multiple-

output (MIMO) channel [7], cognitive radio network [8], and

multiple-input-single-output (MISO) systems [9], [10].

In many investigations [7]–[12], with the help of the

semideﬁnite relaxation (SDR) method, a rank relaxation

method has widely employed in various PLS-SWIPT design

problems, where a semi-deﬁnite programming (SDP) problem

Manuscript received November 12, 2017; accepted November 28, 2017.

Date of publication December 7, 2017; date of current version June 19, 2018.

This work was supported in part by the National Nature Science Foundation

of China under Grant 61571402, Grant 61301150, Grant 61571401, Grant

61640005, Grant 61701214, and Grant 61401401, and in part by the National

Research Foundation funded by the Ministry of Science, ICT and Future

Planning of Korea Government under Grant 2017R1A2B3012316. The asso-

ciate editor coordinating the review of this paper and approving it for

publication was I. Krikidis. (Corresponding author: Zhongyong Wang.)

Z. Zhu and Z. Wang are with the School of Information

Engineering, Zhengzhou University, Zhengzhou 450001, China (e-mail:

zhuzhengyu6@gmail.com; iezywang@zzu.edu.cn).

Z. Chu is with the 5G Innovation Center, Institute of Communication

Systems, University of Surrey, Guildford GU2 7XH, U.K. (e-mail:

zheng.chu@surrey.ac.uk).

F. Zhou is with the School of Information Engineering, Nanchang

University, Nanchang 330031, China (e-mail: zhoufuhui@ncu.edu.cn).

H. Niu is with the College of Communications Engineering,

PLA Army Engineering University, Nanjing 210007, China (e-mail:

niuhaonupt@foxmail.com).

I. Lee is with the School of Electrical Engineering, Korea University,

Seoul 136-713, South Korea (e-mail: inkyu@korea.ac.kr).

Digital Object Identiﬁer 10.1109/LWC.2017.2780830

was generated. Unfortunately, SDP problem can not be guaran-

teed to get a rank-one solution, which serve as a performance

upper bound of the original problem in general. Speciﬁcally,

since the proof of rank-two solution was presented, the

works [9], [10] have generated a suboptimal rank-one solu-

tion by applying a Gaussian randomization (GR) method,

which may not be correct. In addition, if SDP returns a

high-rank solution, the GR method may give rise to poor

performance or even may not obtain the optimal beamforming.

Besides, solving a SDP problem requires higher computational

complexity [15].

It is worth noting that these previous works referring to

PLS-SWIPT were either focus on transmit power minimization

or secrecy rate maximization problem. As another impor-

tant issue of PLS-SWIPT, the research of the max-min fair

energy harvesting (EH) problem still remains infrequent,

which brought extensive attention of academia. So far, only

several literatures [11], [12] studied the max-min fair EH

problem. However, [11] and [12] only considered the signal-to-

interference and noise ratio (SINR) constraint at the informa-

tion receiver. Also, Khandaker and Wong [12] only studied the

case with single-antenna energy harvesting receivers (EHR). In

addition, the SDR method is applied to some works [11], [12],

which results of the higher complexity.

Motivated by these issues, in this letter, the energy harvested

by EH receivers under the rule of a max-min fairness criterion

is optimized while guaranteing the secrecy transmission. The

contributions of this letter are summarized as follows:

• For the perfect channel state information (CSI) case, to

solve a non-convex problem, we present a novel secrecy

rate reformulation as a second-order cone (SOC), and

utilize a ﬁrst-order Taylor approximation to convert the

minimum harvested energy into a linear constraint. To cir-

cumvent rank relaxation, a novel iterative algorithm based

on successive convex approximation (SCA) is proposed

to obtain a near-optimal beamforming.

• For the imperfect CSI case, we extend the max-min EH

fairness problem with deterministic channel uncertain-

ties. According to the SCA method, a robust problem

can be relaxed as a second order cone programming

(SOCP). Thus, a SCA-based iterative algorithm is applied

to compute the near-optimal secure beamforming vector.

Simulation results demonstrate that our proposed algorithms

can achieve the same secrecy performance as the SDR method

with much low complexity.

Notation: {·} stands for the real part of a complex num-

ber. The operator ⊗ is the Kronecker product. [x]

represents

max{x, 0}. A  0 indicates that A is positive semi-deﬁnite, tr

(A), A

and vec(A) means the trace, Frobenius norm and a

column vector where elements of A are stacked, respectively.

II. S

YSTEM MODEL

Considering a secrecy MIMO system with SWIPT which

include one legitimate transmitter (named Alice) equipped

2162-2345

 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.

下载后可阅读完整内容，剩余3页未读，立即下载

weixin_38629939

粉丝: 11
资源: 925

MIMO SWIPT系统安全波束成形优化策略

基于IRS辅助的SWIPT物联网系统安全波束成形设计.docx

大规模MIMO中的SWIPT的稳健波束成形

AN辅助多用户MIMO SWIPT安全波束成形与功率分配策略

多用户MIMO SWIPT系统中的AN辅助安全传输

通过无线信息和功率传输实现MIMO广播的安全波束成形

带有协作干扰器的AN辅助安全MU-MIMO SWIPT系统中的能量收集公平性

ajitdbit.zip_MIMO波束成形_beam tracking_mimo ofdm 压缩_波束成形 MIMO_波束追踪

多用户MIMO SWIPT系统的AN辅助安全传输策略

多跳MIMO系统中SWIPT的联合波束优化：最大化信息速率

多用户MIMO SWIPT系统中MSE QoS约束的联合优化设计

最新资源