In this paper, we consider a wireless network where a source tries to send messages to a destination while keeping them secret from multiple eavesdroppers. To enhance secrecy, the transmission is performed with a cooperation of friendly jammers which make artificial noise to confound eavesdroppers and beamforming technique to direct jamming signal to intended targets. The purpose is to determine beamforming coefficients in order to maximize secrecy rate under the total jammer power constraint. The existing method solved this problem in a special case in which the beamforming coefficients were designed to completely eliminate jamming signal at the destination and a heuristic approach was applied to obtain a suboptimal solution for this case. We address this problem via a new approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm). We first reformulate this problems as a general DC program, i.e. minimizing a DC function under some DC constraints, and develop a DCA based algorithm for solving it. The experimental results show that the secrecy rate obtained by the proposed algorithm is better than those achieved by the existing one.
In this paper, we consider a wireless network where a source tries to send messages to a destination while keeping them secret from multiple eavesdroppers. To enhance secrecy, the transmission is performed with a cooperation of friendly jammers which make artificial noise to confound eavesdroppers and beamforming technique to direct jamming signal to intended targets. The purpose is to determine beamforming coefficients in order to maximize secrecy rate under the total jammer power constraint. The existing method solved this problem in a special case in which the beamforming coefficients were designed to completely eliminate jamming signal at the destination and a heuristic approach was applied to obtain a suboptimal solution for this case. We address this problem via a new approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm). We first reformulate this problems as a general DC program, i.e. minimizing a DC function under some DC constraints, and develop a DCA based algorithm for solving it. The experimental results show that the secrecy rate obtained by the proposed algorithm is better than those achieved by the existing one.
This paper adopts the antenna selection technique to enhance the covert rate in a wireless communication network comprised of a source, a destination , an external jammer and an eavesdropper. In the covert communication, the level of transmit power is low and hence a source with multiple antennas can be adopted to send the information toward the single antenna destination while concurrently, the jammer transmits an artificial noise signal. For this system model, we consider a scenario where the source is forced to select one or several of its antennas to transmit its confidential information due to its limited RF chains. Furthermore, we consider two different jamming scenarios to support our covert communication: 1) The destination is unable to cancel the jamming signal, 2) The destination can subtract the jamming signal. For such a communication network, our aim is to maximize the covert rate subject to power constraint and covert communication requirement. In the first scenario, the optimization problem is non-convex, and hence, it can be solved through using Difference of Convex function (DC) method while the optimization problem of the second scenario is intrinsically convex. Our numerical results show that the higher the number of selected antennas at the transmitter, the higher the covert rate will be achieved.
This paper proposes a joint cooperative relaying and jamming scheme based on distributed beamforming to enhance the secrecy rate of a wireless channel in the presence of an eavesdropper. Specifically, we consider the scenario that a source node transmits messages to a destination with the help of multiple cooperative relays, where a relay might be compromised to become an eavesdropper as an inside attacker. Our joint relaying and jamming approach is to assign some relay nodes to act as jammers to interfere the eavesdropper, while the remaining ones continue relaying information to the destination. We propose a protocol to implement the joint cooperative relaying and jamming. Our protocol further considers the particular challenge brought by the inside attacker: it may know the jamming signal and can use it to remove the interference from the jammers. The issue of phase and frequency synchronization in the distributed beamforming is also taken into account. A mixed integer programming problem is formulated to maximize the secrecy rate with the proposed joint relaying and jamming, by which the optimal role assignment to a relay and the associated optimal power assignment can be solved. Numerical results are presented to demonstrate the efficiency of the proposed joint relaying and jamming in improving the secrecy rate, with comparison to existing approaches.
Physical layer security is to enable confidential data transmission through wireless networks in the presence of illegitimate users, without basing on higher-layer encryption. The essence of physical layer security is to maximize the secrecy rate, that is the maxi- mum rate of information without intercepted by the eavesdroppers. Besides, the design of physical layer security considers the transmit power minimization. These two objectives conflict with each other. Consequently, the research on physical layer security designs often focuses on the two main classes of optimization problems: maximizing secrecy rate under the transmit power constraint and minimizing power consumption while guaranteeing the secrecy rate constraint. These problems are nonconvex, thus, hard to solve. In this thesis, we focus on developing optimization approaches to solve these two optimization problem classes. Our methods are based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) which well-known as one of the most powerful approaches in optimization. In the first part, we consider three classes of secrecy rate maximization problems (chapters 2, 3, 4). In particular, chapter 2 studies the secure information transmission in a multiple-input single-output (MISO) relay system by using joint beamforming and artificial noise strategy under the deterministic uncertainty channel models of all links. Without using a relay, chapter 3 addresses the problem of transfer wireless information and power simultaneously in MISO secure system where scenarios of perfect channel state information and deterministic uncertainty channel models are concerned. Transmit beamforming without artificial noise and that with artificial noise are investigated. Under the assumption of statistical channel state information to eavesdroppers, chapter 4 studies the probability constrained secrecy rate maximization problem in multiuser MISO simultaneous wireless information and power transfer (SWIPT) system. The unified approach based on DC programming and DCA is proposed to solve three classes of optimization problems. The optimization problem in chapter 2 is recast as two general DC programs. The general DCA schemes are proposed to solve these two DC programs. In chapter 3, we consider four optimization problems in accordance with four scenarios. Exploiting the special structures of these original optimization problems, we transform it into four general DC programs for which the corresponding general DCA based algorithms are developed. In chapter 4, we first transform the considered problem into a tractable form. We then develop an alternating scheme to solve the transformed problem. Two general DC programs are proposed in each step of the alternating scheme. For solving these DC programs, we study a variant of general DCA, namely, DCA−ρ scheme. The convergence of alternating general DCA−ρ scheme is proven. The second part studies the transmit power optimization problem under the probability constraints of secrecy rate and harvested energy in a MISO SWIPT system (chapter 5). We reformulate the original problem as three general DC programs for which the corresponding general DCA-based algorithms are investigated. Numerical results demonstrate the efficiency of the proposed algorithms.
In this paper, the security of two-phase relaying system with multiple intermediate nodes in the presence of a malicious eavesdropper is investigated. To enhance the secrecy, a joint cooperative beamforming and jamming combined with relay and jammer selection is proposed. First, the source broadcasts its signal to the relays that are located close to source in a cluster, i.e., the source node uses a small amount of power to broadcast its message locally to other nodes of the cluster, while destination and the eavesdropper are located outside this cluster. In the second phase, two relays transmit re-encoded signal with optimal beamforming such that the secrecy rate is maximized. Simultaneously, two other intermediate nodes (which act as friendly jammers) transmit random jamming signals to degrade the eavesdropper’s channel. Our goal in this paper is to maximize the secrecy rate by applying different methods such as cooperative beamforming, cooperative jamming and relay and jammer selection. To avoid operational complexity, we consider the minimum number of intermediate nodes needed for relaying and jamming without losing the performance, i.e., achieving a non-zero secrecy rate. Cooperative beamforming with multiple relays demands high amount of information exchange and therefore increases the operational complexity. Thus, we aim to reduce the number of relays which take part in cooperative beamforming. Limiting the number of relays may have a bad effect on the coding gain which we compensate it with a proposed selection gain scheme. Numerical results demonstrate the advantage of our proposed scheme compared to the scheme with no cooperative jamming. The main contribution of this work is combining cooperative beamforming and jamming with relay and jammer selection to enhance the physical layer security.
This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.
In this paper, we consider a two-way relay network system which contains multiple cooperative relays transmitting information between two sources with attendance of an eavesdropper. A null space beamforming scheme is applied to ensure the secrecy in system. Our goal is achieving maximal secrecy sum rate with a certain level power transmit. In [1], authors propose an approach to solve Secrecy Sum Rate Maximization (SSRM) problem, whereas we use another approach based on Different of Convex Functions Algorithm (DCA).