This paper considers simultaneous wireless information apower transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretapnd power transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretap channel with energy harvesting receivers. The main objective is to keep the probability of the legitimate user's achievable secrecy rate outage as well as the energy receivers' harvested energy outage as caused by CSI uncertainties below given thresholds. This probabilistic-constrained secrecy rate maximization problem presents a significant analytical and computational challenge since any closed-form for the probabilistic constraints with log-det functions is intractable. In this paper, we address this challenging issue using codeviation inequalitiesnvex restrictions. In particular, we derive decomposition-based large deviation inequalities to transform the probabilistic constraints into second-order cone (SOC) constraints which are easier to handle. Then we show that a robust safe solution can be obtained through solving two convex sub-problems in an alternating fashion.
This paper considers simultaneous wireless information apower transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretapnd power transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretap channel with energy harvesting receivers. The main objective is to keep the probability of the legitimate user's achievable secrecy rate outage as well as the energy receivers' harvested energy outage as caused by CSI uncertainties below given thresholds. This probabilistic-constrained secrecy rate maximization problem presents a significant analytical and computational challenge since any closed-form for the probabilistic constraints with log-det functions is intractable. In this paper, we address this challenging issue using codeviation inequalitiesnvex restrictions. In particular, we derive decomposition-based large deviation inequalities to transform the probabilistic constraints into second-order cone (SOC) constraints which are easier to handle. Then we show that a robust safe solution can be obtained through solving two convex sub-problems in an alternating fashion.
This paper considers simultaneous wireless information and power transfer in a multiple-input single-output downlink system consisting of one multi-antenna transmitter, one single-antenna information receiver, multiple multi-antenna eavesdroppers (Eves), and multiple single-antenna energy-harvesting receivers (ERs). The main objective is to keep the probability of the legitimate user's achievable secrecy rate outage as well as the ERs' harvested energy outage caused by channel state information uncertainties below some prescribed thresholds. As is well known, the secrecy rate outage constraints present a significant analytical and computational challenge. Incorporating the energy harvesting outage constraints only intensifies that challenge. In this paper, we address this challenging issue using convex restriction approaches which are then proved to yield rank-one optimal beamforming solutions. Numerical results reveal the effectiveness of the proposed schemes.
In this paper, we consider a multiuser multiple-input multiple-output (MIMO) downlink communication system with simultaneous wireless information and power transfer (SWIPT). In particular, we focus on a realistic and efficient multi-receiver multi-eavesdropper MIMO SWIPT system, in which the channel state information (CSI) of each legitimate receiver and energy receiver (i.e., potential eavesdropper) is partially known to the transmitter. Based on this, we propose a robust artificial noise (AN)-aided secure transmission scheme for the system, where the channel uncertainties are modeled by the worst-case model. In the proposed scheme, we aim to maximize the worst-case achievable secrecy rate under the transmit power constraint and the energy harvesting (EH) constraint, by jointly optimizing the transmit precoding matrix and the AN covariance matrix. We utilize the S-Procedure and Taylor series approximation to transform the non-convex problem. Then, we apply the interior point method to tackle the transformed convex problem, obtaining the approximate optimal matrices and the corresponding maximum worst-case secrecy rate. Simulation results show that our proposed scheme achieves significant performance improvements in terms of convergence and the worst-case achievable secrecy rate.
This paper studies the secure transmission issue for simultaneous wireless information and power transfer in a multiuser multiple-input-multiple-output system with multiple external eavesdroppers, where the transmitter broadcasts independent confidential messages to different legitimate receivers. Each receiver can be seen as an internal eavesdropper intended by other receivers. Our objective is to achieve the robust beamforming design under imperfect channel state information, in which the total transmission power is minimized with constraints on the achievable secrecy rate and the energy harvesting. Since the problem is nonconvex, we propose a two-level optimization scheme. For the inner problem, we investigate two conservative relaxation approaches, large-deviation inequality and Bernstein-type inequality (BTI), to reformulate the outage secrecy rate constraints into some convex ones, yielding a convex optimization by semidefinite programming (SDP) relaxation. For the outer problem, it is a K-variable optimization problem, which can be solved via the novel line-dimensional-like search method. Moreover, we characterize the rank profile of SDP relaxed solution for these two approaches. Specifically, the optimal solution is proved to be rank-one. Numerical results are provided to verify the performance of the proposed algorithms, where the LDI-based scheme outperforms the BTI-based scheme in terms of energy efficiency.
In this letter, we consider a multiple-input-multiple-output (MIMO) downlink system with simultaneous wireless information and power transfer (SWIPT), where the information sent to the desired receiver (DR) may be wiretapped by the malicious energy harvesting (EH) receivers (potential eavesdroppers). Assuming the channel state information (CSI) of the EH receivers is not perfectly known at the transmitter, we aim to maximize the worst-case secrecy rate by jointly designing the precoding matrix, AN covariance matrix and power splsplitting ratio, under the constraints of total transmit power and harvested energyitting ratio, under the constraints of total transmit power and harvested energy at receivers. The formulated problem is non-convex and semi-infinite, which is hard to tackle. To solve it, we first deal with the non-convexity caused by CSI errors with the aid of the S-Procedure, and then employ the Taylor series approximation techniques to transfer the nonconvex problem into a convex optimization problem. Based on that, we propose an iterative algorithm with proved convergence to solve the original problem. Simulation results are finconvex optimization problem. Based on that, we propose an iterative algorithmally provided to show the effectiveness of our proposed robust transmit design.
This paper addresses robust designs of secure simultaneous wireless information and power transfer for multiple-input single-output (MISO) multiuser systems. By using a bounded uncertainty model for the channel state information (CSI) from transmitters to legitimate receivers and under the assumption of only available statistic knowledge of the CSI to eavesdroppers, we consider the robust designs with both worst-case and chance-constrained optimizations. To jointly optimize transmit beamforming vectors and power splitting factors, we formulate three problems aiming at minimizing the system power, maximizing the sum secrecy rate, and maximizing the minimal secrecy rate, respectively, subject to both energy harvesting and secrecy outage constraints. These problems are intractable in their original forms due to the CSI models and their non-convexity. To reach computationally efficient solutions, we first rewrite the original problems by semi-definite relaxation, then transform the CSI uncertainty related constraints by S-procedure, and finally approximate the non-convex constraints by the first-order Taylor expansion. By the reformulations, we present iterative successive convex approximation algorithm for approaching the optimized solutions. Simulation results under various setups of system parameters are provided to examine the system performance and validate the effectiveness of the proposed schemes.
This letter studies transmit optimization in three-node multiple-input-multiple-output wiretap channels with simultaneous wireless information and power transfer. In particular, we address the transmit covariance optimization for the energy-harvesting maximization (EHM) problem under the constraint of secrecy rate and transmit power. The problem is nonconvex and hard to tackle. To circumvent it, we first resort to the Taylor series expansion to convert the problem into a convex optimization problem. Then, based on the analysis of its dual problem, an iterative algorithm, which includes a semiclosed-form solution, is proposed to handle this EHM problem. The scenario of imperfect channel state information of an energy receiver (the potential eavesdropper) is also considered. In this scenario, a Bernstein-type inequality-based iterative algorithm is proposed to deal with the challenging outage-constrained EHM problem. Simulation results demonstrate the efficiency of our proposed designs.