15 research outputs found
Secure Transmission in Amplify-and-Forward Diamond Networks with a Single Eavesdropper
Unicast communication over a network of -parallel relays in the presence
of an eavesdropper is considered. The relay nodes, operating under individual
power constraints, amplify and forward the signals received at their inputs.
The problem of the maximum secrecy rate achievable with AF relaying is
addressed. Previous work on this problem provides iterative algorithms based on
semidefinite relaxation. However, those algorithms result in suboptimal
performance without any performance and convergence guarantees. We address this
problem for three specific network models, with real-valued channel gains. We
propose a novel transformation that leads to convex optimization problems. Our
analysis leads to (i)a polynomial-time algorithm to compute the optimal secure
AF rate for two of the models and (ii) a closed-form expression for the optimal
secure rate for the other.Comment: 12pt font, 18 pages, 1 figure, conferenc
Enhancing wireless security via optimal cooperative jamming
In this work, we analyze the secrecy rate in a cooperative network, where a source node is assisted by relay nodes via cooperative jamming for delivering a secret message to the destination in the presence of an eavesdropper node. We consider the availability of both full and partial channel state information (CSI), and we take into account average power limitation at the relays as we formulate the rate maximization problem as a primal-dual problem. We derive the closed form solution for the full CSI case, and we show that the optimal solution allows the transmission of only one relay. For the partial CSI case, we define the concept of secrecy outage, where some of packets are intercepted by the eavesdropper, and we derive the secrecy outage probability and throughput in terms of average channel statistics. Due to the high nonlinearity of the secrecy throughput term, we propose a gradient update algorithm for obtaining the optimal power solutions for the partial CSI case. Our simulations demonstrate the gains of cooperative jamming over direct transmission for both full and partial CSI cases, where it is shown that the secrecy rate of the direct transmission is increased significantly, by %20−%80, when CJ is employed with our optimal power assignment algorithm
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Secure communications can be impeded by eavesdroppers in conventional relay
systems. This paper proposes cooperative jamming strategies for two-hop relay
networks where the eavesdropper can wiretap the relay channels in both hops. In
these approaches, the normally inactive nodes in the relay network can be used
as cooperative jamming sources to confuse the eavesdropper. Linear precoding
schemes are investigated for two scenarios where single or multiple data
streams are transmitted via a decode-and-forward (DF) relay, under the
assumption that global channel state information (CSI) is available. For the
case of single data stream transmission, we derive closed-form jamming
beamformers and the corresponding optimal power allocation. Generalized
singular value decomposition (GSVD)-based secure relaying schemes are proposed
for the transmission of multiple data streams. The optimal power allocation is
found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows
significant improvement in terms of secrecy rate compared to the approach
without jamming. Furthermore, the case involving an eavesdropper with unknown
CSI is also investigated in this paper. Simulation results show that the
secrecy rate is dramatically increased when inactive nodes in the relay network
participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal
Processin