11 research outputs found

    To Harvest and Jam: A Paradigm of Self-Sustaining Friendly Jammers for Secure AF Relaying

    Get PDF
    This paper studies the use of multi-antenna harvest-and-jam (HJ) helpers in a multi-antenna amplify-and-forward (AF) relay wiretap channel assuming that the direct link between the source and destination is broken. Our objective is to maximize the secrecy rate at the destination subject to the transmit power constraints of the AF relay and the HJ helpers. In the case of perfect channel state information (CSI), the joint optimization of the artificial noise (AN) covariance matrix for cooperative jamming and the AF beamforming matrix is studied using semi-definite relaxation (SDR) which is tight, while suboptimal solutions are also devised with lower complexity. For the imperfect CSI case, we provide the equivalent reformulation of the worst-case robust optimization to maximize the minimum achievable secrecy rate. Inspired by the optimal solution to the case of perfect CSI, a suboptimal robust scheme is proposed striking a good tradeoff between complexity and performance. Finally, numerical results for various settings are provided to evaluate the proposed schemes.Comment: 16 pages (double column), 8 figures, submitted for possible journal publicatio

    Physical layer security jamming: Theoretical limits and practical designs in wireless networks

    Get PDF
    Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined

    Physical layer security jamming : Theoretical limits and practical designs in wireless networks

    Get PDF
    Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined

    Physical Layer Security With RF Energy Harvesting in AF Multi-Antenna Relaying Networks

    Get PDF
    In this paper, we analyze the secrecy capacity of a half-duplex energy harvesting (EH)-based multi-antenna amplify-and-forward relay network in the presence of a passive eavesdropper. During the first phase, while the source is in the transmission mode, the legitimate destination transmits an auxiliary artificial noise (AN) signal which has two distinct purposes: 1) to transfer power to the relay and 2) to improve system security. Since the AN is known at the legitimate destination, it is easily cancelled at the intended destination, which is not the case at the eavesdropper. In this respect, we derive new exact analytical expressions for the ergodic secrecy capacity for various well-known EH relaying protocols, namely, time switching relaying (TSR), power splitting relaying (PSR), and ideal relaying receiver (IRR). Monte Carlo simulations are also provided throughout our investigations to validate the analysis. The impacts of some important system parameters, such as EH time, power splitting ratio, relay location, AN power, EH efficiency, and the number of relay antennas, on the system performance are investigated. The results reveal that the PSR protocol generally outperforms the TSR approach in terms of the secrecy capacity

    Resource allocation and secure communication design in simultaneous wireless information and power transfer systems

    Get PDF
    Radio frequency (RF) energy transfer techniques have been regarded as the key enabling solutions to supply continuous and stable energy for the energy-constrained wireless devices. Simultaneous wireless information and power transfer (SWIPT) has been developed as a more promising RF energy transfer technique since it enables wireless information and wireless energy to access users from a same transmitted signal. Therefore, SWIPT has received remarkable attention. This thesis provides an investigation on applications and security issues of this emerging technology in various wireless communication scenarios. First, this thesis examines the application of SWIPT to a multi-user cooperative network in which the amplify-and-forward (AF) relay protocol is employed at the multi-antenna relay. A power splitting (PS) receiver architecture is utilized at each destination node to implement energy harvesting (EH) and information decoding (ID) simultaneously. The aim of this chapter is to minimize the relay transmit power by jointly designing relay beamforming vectors and PS ratios based on channel uncertainty models. The non-convex problem is converted into a semidefinite programming (SDP) problem by using the semidefinite relaxation (SDR) approach. In addition, a rank-one proof presents that the solution generated by the relaxed problem is optimal to the original problem. Second, a security issue about the SWIPT system is investigated in a cooperative network in the presence of potential eavesdroppers. The AF relay protocol and a PS receiver architecture are adopted at the multi-antenna relay and the desired destination node, respectively. Based on the system setup and the assumption of perfect channel state information (CSI), a transmit power minimization problem combined with the secrecy rate and harvested energy constraints is proposed to jointly optimize the beamforming vector and the PS ratio. The proposed optimization problem is non-convex and hard to tackle due to the issues of the quadratic terms and the coupled variables. To deal with this non-convex problem, two algorithms are proposed. In the first algorithm case, the proposed problem can be globally solved by using a two-level optimization approach which involves the SDR method and the one-dimensional (1-D) line search method. In addition, a rank reduction theorem is introduced to guarantee the tightness of the relaxation of the proposed scheme. In the second algorithm case, the proposed problem can be locally solved by exploiting a low complexity iterative algorithm which is embedded in the sequential parametric convex approximation (SPCA) method. Furthermore, the proposed optimization problem is extended to the imperfect CSI case. Third, a secure communication case is studied in an underlay multiple-input multiple-output (MIMO) cognitive radio (CR) network where the secondary transmitter (ST) provides SWIPT to receivers. In this chapter, two uncertainty channel models are proposed. One is based on the assumption that the ST has the perfect channel knowledge of the secondary information receiver (SIR) and the imperfect channel knowledge of secondary energy receivers (SERs) and primary receivers (PUs). The other one assumes that the ST only has the imperfect channel knowledge of all receivers. In each uncertainty channel model, an outage-constrained secrecy rate maximization (OC-SRM) problem combined with probability constraints is proposed to jointly optimizing the transmit covariance matrix and the artificial noise (AN)- aided covariance matrix. The designed OC-SRM problem for both models is non-convex due to the unsolvable probabilistic constraints. To solve this non-convex problem, the log determinant functions are first approximated to the easy handle the functions that the channel error terms are included in the trace function. Then, the probability constraints are converted into the deterministic constraints by exploiting the Bernstein-type inequality (BTI) approach. Finally, the reformulated problem for both models is solvable by using the existing convex tools. Last, a novel security issue is investigated in a MIMO-SWIPT downlink network where nonlinear energy receivers (ERs) are considered as the potential eavesdroppers. In this chapter, two uncertainty channel models, namely partial channel uncertainty (PCU) and full channel uncertainty (FCU), are proposed. An OC-SRM problem of each model is proposed to design the transmit signal covariance matrix while satisfying probabilistic constraints of the secrecy rate and the harvested energy. To surmount the non-convexity of the proposed OC-SRM problem in each model, several transformations and approximations are utilized. In the PCU model, the OC-SRM problem is first converted into two subproblems by introducing auxiliary variables. Then, three conservative approaches are adopted to obtain the safe approximation expressions of the probabilistic constraints, which are deterministic constraints. Moreover, an alternating optimization (AO) algorithm is proposed to iteratively solve two convex conic subproblems. In the FCU model, log determinant functions are first approximated to the trace functions. Then, the three approaches aforementioned are employed to convert probabilistic constraints into deterministic ones. The bisection method is utilized to solve the reformulated problem. Finally, the computational complexity of the proposed three approaches based on the PCU and FCU model is analyzed
    corecore