This paper considers a basic MIMO information-energy broadcast system, where a multi-antenna transmitter transmits information and energy simultaneously to a multi-antenna information receiver and a dual-functional multi-antenna energy receiver which is also capable of decoding information. Due to the open nature of wireless medium and the dual purpose of information and energy transmission, secure information transmission while ensuring efficient energy harvesting is a critical issue for such a broadcast system. Assuming that physical layer security techniques are adopted for secure transmission, we study beamforming design to maximize the achievable secrecy rate subject to a total power constraint and an energy harvesting constraint. First, based on semidefinite relaxation, we propose global optimal solutions to the secrecy rate maximization (SRM) problem in the single-stream case and a specific fullstream case. Then, we propose inexact block coordinate descent (IBCD) algorithm to tackle the SRM problem of general case with arbitrary number of streams. We proves that the IBCD algorithm can monotonically converge to a Karush-Kuhn-Tucker (KKT) solution to the SRM problem. Furthermore, we extend the IBCD algorithm to the joint beamforming and artificial noise design problem. Finally, simulations are performed to validate the effectiveness of the proposed beamforming algorithms. Index TermsBeamforming, wireless information and power transfer, secrecy rate maximization, semidefinite relaxation, block coordinate descent.
This paper proposes a new distributed Kalman filtering fusion with random state transition and measurement matrices, i.e., random parameter matrices Kalman filtering. It is proved that under a mild condition the fused state estimate is equivalent to the centralized Kalman filtering using all sensor measurements; therefore, it achieves the best performance. More importantly, this result can be applied to Kalman filtering with uncertain observations including the measurement with a false alarm probability as a special case, as well as, randomly variant dynamic systems with multiple models. Numerical examples are given which support our analysis and show significant performance loss of ignoring the randomness of the parameter matrices.
We consider the multiuser beamforming problem for a multi-input single-output downlink channel that takes into account the errors in the channel state information at the transmitter side (CSIT). By modeling the CSIT errors as elliptically bounded uncertainty regions, this problem can be formulated as minimizing the transmission power subject to the worst-case signal-to-interference-plus-noise ratio constraints. Several methods have been proposed to solve this nonconvex optimization problem, but none can guarantee a global optimal solution. In this article, we consider a semidefinite relaxation (SDR) for this multiuser beamforming problem, and prove that the SDR method actually solves the robust beamforming problem to global optimality as long as the channel uncertainty bound is sufficiently small or when the transmitter is equipped with at most two antennas. Numerical examples show that the proposed SDR approach significantly outperforms the existing methods in terms of the average required power consumption at the transmitter.
In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power and secrecy rate outage probability constraint. The outage probability constraint requires that the secrecy rate exceeds certain threshold with high probability.Therefore including such constraint in the design naturally ensures the desired robustness. Unfortunately, the presence of the probabilistic constraints makes the problem non-convex and hence difficult to solve.In this paper, we investigate the outage probability constrained secrecy rate maximization problem using a novel two-step approach. Under a wide range of uncertainty models, our developed algorithms can obtain high-quality solutions, sometimes even exact global solutions, for the robust secure beamformer design problem. Simulation results are presented to verify the effectiveness and robustness of the proposed algorithms. DRAFT Recently, considerable research has investigated optimization algorithms for improving secrecy rate in wiretap channels with multiple antennas [5]- [11].There are roughly two approaches for designing transmission schemes in the presence of multiple transmit antennas: 1) single-stream transmit beamforming, in which the transmit signal is steered towards the legitimate receiver, while the power leakage to the eavesdroppers is reduced at the same time; 2) joint beamforming and artificial noise (AN) generation, in which the transmit power is split into a data stream and an AN [12]- [15]. The AN is used to generate interference DRAFT
Abstract-The performance of full-duplex (FD) relay systems can be greatly impacted by the self-interference (SI) at relays. By exploiting multi-antenna in FD relay systems, the spectral efficiency of FD relay systems can be enhanced through spatial SI mitigation. This paper studies joint source transmit beamforming and relay processing to achieve rate maximization for FD MIMO amplify-and-forward (AF) relay systems with consideration of relay processing delay. The problem is difficult to solve due mainly to the SI constraint induced by the relay processing delay. In this paper, we first present a sufficient condition under which the relay amplification matrix has rank one structure. Then, for the case of rank one amplification matrix, the rate maximization problem is equivalently simplified into an unconstrained problem which can be locally solved using gradient ascent method. Next, we propose a penalty-based algorithmic framework, called P-BSUM, for a class of constrained optimization problems which have difficult equality constraints in addition to some convex constraints. By rewriting the rate maximization problem with a set of auxiliary variables, we apply the P-BSUM algorithm to the rate maximization problem in the general case. Finally, numerical results validate the efficiency of the proposed algorithms and show that the joint source-relay design approach under the rank one assumption could be strictly suboptimal as compared to the P-BSUM-based joint source-relay design approach.Index Terms-Full-duplex relaying, MIMO, joint source-relay design, penalty method, BSUM. I. INTRODUCTIONTo simplify transceiver design and reduce implementation cost, traditional relay systems work in half-duplex (HD) mode, where the source and relay transmit signal in two orthogonal and dedicated channels. This inherently results in a waste of channel resources and incurs loss of spectrum efficiency. As compared to the HD relaying, full-duplex (FD) relaying, where the relay node can simultaneously transmit and receive signals over the same frequency band, has potential to approximately double the system spectral efficiency. Hence, with the recent advance of self-interference cancellation technologies, FD relaying has received a great deal of attentions [1]- [5].When the relay operates in the FD mode, the loopback interference, also known as self-interference (SI), occurs due
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.