This paper studies the design and secrecy performance of linear multihop networks, in the presence of randomly distributed eavesdroppers in a large-scale 2-D space. Depending on whether there is feedback from the receiver to the transmitter, we study two transmission schemes: an ON–OFF transmission (OFT) and a non-ON–OFF transmission (NOFT). In the OFT scheme, transmission is suspended if the instantaneous received signal-to-noise ratio (SNR) falls below a given threshold, whereas, there is no suspension of transmission in the NOFT scheme. We investigate the optimal design of the linear multiple network in terms of the optimal rate parameters of the wiretap code as well as the optimal number of hops. These design parameters are highly interrelated, since more hops reduce the distance of per-hop communication, which completely changes the optimal design of the wiretap coding rates. Despite the analytical difficulty, we are able to characterize the optimal designs and the resulting secure transmission throughput in mathematically tractable forms in the high SNR regime. Our numerical results demonstrate that our analytical results obtained in the high SNR regime are accurate at practical SNR values. Hence, these results provide useful guidelines for designing linear multihop networks with targeted physical layer security performance.
This paper studies the design and secrecy performance of linear multihop networks, in the presence of randomly distributed eavesdroppers in a large-scale 2-D space. Depending on whether there is feedback from the receiver to the transmitter, we study two transmission schemes: an ON–OFF transmission (OFT) and a non-ON–OFF transmission (NOFT). In the OFT scheme, transmission is suspended if the instantaneous received signal-to-noise ratio (SNR) falls below a given threshold, whereas, there is no suspension of transmission in the NOFT scheme. We investigate the optimal design of the linear multiple network in terms of the optimal rate parameters of the wiretap code as well as the optimal number of hops. These design parameters are highly interrelated, since more hops reduce the distance of per-hop communication, which completely changes the optimal design of the wiretap coding rates. Despite the analytical difficulty, we are able to characterize the optimal designs and the resulting secure transmission throughput in mathematically tractable forms in the high SNR regime. Our numerical results demonstrate that our analytical results obtained in the high SNR regime are accurate at practical SNR values. Hence, these results provide useful guidelines for designing linear multihop networks with targeted physical layer security performance.
The problem of secure unicast communication over multihop wireless relay networks with directed links in the presence of an eavesdropper is considered. In the existing literature this problem has been considered in one or both of the following two scenarios: (A) relay nodes employ relaying schemes, such as Decode-and-Forward (DF), (B) the source communicates with the destination over a two-hop relay network. We argue that computationally complex relaying schemes such as DF render end-to-end performance characterization intractable, without providing any performance guarantee in general channel and network scenarios. Therefore, we consider one of the simplest relaying scheme: Amplify-and-Forward (AF) that allows us to provide guarantees on the optimal performance over a wide range of channel conditions. A node performing AF-relaying scales and forwards the signal received at its input. Further, with AF-relaying the end-to-end performance characterization problem remains tractable for much larger class of networks than those that can be considered with other relaying schemes. The key contribution of this work is twofold. We first provide the optimal vector of scaling factors that maximizes the achievable AF secrecy rate, no matter which relay the eavesdropper listens to. Further, we prove that in high-SNR regime, the optimal AF secrecy rate thus achieved is within a constant gap from the cutset upper bound on the secrecy capacity.
We design a novel artificial-noise-aided secure ON-OFF transmission scheme in a wiretap channel. We consider a practical scenario, where the multi-antenna transmitter only obtains partial channel knowledge from the single-antenna receiver through limited training and feedback but has no channel knowledge about the single-antenna eavesdropper. In the design, we first propose a three-period block transmission protocol to capture the practical training and quantization features. We then characterize the statistics of the received signal-to-noise ratios at the receiver and the eavesdropper. Under the secrecy outage constraint, we exploit the ON-OFF scheme to perform secure transmission and derive a closed-form expression for the secrecy throughput. Moreover, we investigate the optimization problem of maximizing the secrecy throughput by proposing an iterative algorithm to determine the optimal power allocation between the information signal and artificial noise, as well as the optimal codeword transmission rate. Furthermore, we define the net secrecy throughput (NST), which takes the signaling overhead into account and address the problem of optimally allocating the block resource to the training and feedback overhead. Numerical results clearly demonstrate how the optimal signaling overhead changes with the number of transmit antennas, and there exists an optimal number of antennas that maximizes the NST.
We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and- forward relay in the presence of spatially random- distributed eavesdroppers. We assume that the source is equipped with multiple antennas, whereas the relay, the destination, and the eavesdroppers are equipped with a single antenna each. In the proposed scheme, in addition to information signals, the source transmits artificial noise signals in order to confuse the eavesdroppers. With the target of maximizing the secrecy throughput of the relay wiretap channel, we derive a closed-form expression for the transmission outage probability and an easy-to-compute expression for the secrecy outage probability. Using these expressions, we determine the optimal power allocation factor and wiretap code rates that guarantee the maximum secrecy throughput, while satisfying a secrecy outage probability constraint. Furthermore, we examine the impact of source antenna number on the secrecy throughput, showing that adding extra transmit antennas at the source brings about a significant increase in the secrecy throughput.
In this paper, the physical-layer security of a cooperative wireless system with multi-antenna full-duplex (FD) destination is examined. More specifically, we consider a cooperative transmission scenario in which a source communicates with a destination through a relay in the presence of an eavesdropper. In order to degrade the wiretap channel, the FD destination simultaneously transmits an interference signal towards the eavesdropper, while receiving information from the relay. A joint transmit and receive beamformer design is proposed to maximize the signal-to-interference-plus-noise ratio (SINR) at the destination, while guaranteeing that the SINR at the eavesdropper is below a certain threshold. We reformulate the optimization problem as a semidefinite relaxation problem in terms of a transmit beamforming matrix. To balance the performance and system complexity, we investigate suboptimum beamforming designs based on zero-forcing criterion. We derive exact closed-form expressions for the average secrecy rates of the proposed suboptimum designs. Our results reveal that optimum and suboptimum beamforming schemes along with friendly jamming significantly improve the secrecy performance. Moreover, simulation results demonstrate that the optimum scheme outperforms suboptimum schemes, especially in high transmit power regimes.
We design a new relay-aided secure transmission scheme, in which a source communicates with a destination through a trusted decode-and-forward relay in the presence of spatially random-distributed non-colluding eavesdroppers. We consider a general antenna configuration, in which the source, relay, destination, and eavesdroppers are equipped with multiple antennas. We assume that both the source and the relay transmit artificial noise signals in addition to information signals. We also assume that the source and the relay adopt different codebooks, and that the transmitted signals from the source and relay are not jointly processed at each eavesdropper. We first derive a closed-form expression for the transmission outage probability and a new expression for the secrecy outage probability. Notably, these expressions are valid for an arbitrary number of antennas at the source, relay, and destination. We then derive simple yet valuable expressions for the asymptotic transmission outage probability and the asymptotic secrecy outage probability, which reveal the secrecy performance when the number of antennas at the source grows sufficiently large. Using our expressions, we quantify a practical performance metric, namely, the secrecy throughput, under a secrecy outage probability constraint. We further determine the system and channel parameters that maximize the secrecy throughput, leading to analytical security solutions suitable for real-world deployment.
In this paper, we study the secure multi-antenna transmission with artificial noise (AN) under slow fading channels coexisting with randomly located eavesdroppers. We provide a comprehensive secrecy performance analysis and system design/optimization under a stochastic geometry framework. Specifically, we first evaluate the secrecy outage performance, and derive a closed-form expression for the optimal power allocation ratio of the information signal power to the total transmit power that minimizes the secrecy outage probability (SOP). Subject to a SOP constraint, we then propose a dynamic parameter transmission scheme (DPTS) and a static parameter transmission scheme (SPTS) to maximize secrecy throughput, and provide explicit solutions on the optimal transmission parameters, including the wiretap code rates, the on-off transmission threshold and the power allocation ratio. Our results give new insight into secure transmission designs. For example, secrecy rate is a concave function of the power allocation ratio in DPTS, and AN plays a significant role under SOP constraints and in dense eavesdropper scenarios. In SPTS, transmission probability is a concave function of the power allocation ratio, and secrecy throughput is a quasi-concave function of the secrecy rate. Numerical results are demonstrated to validate our theoretical analysis.