Destination Assisted Cooperative Jamming for Wireless Physical-Layer Security

Abstract

A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system power <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> and the number of available relays <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> according to 1/2log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> (1 + <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> /8log <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> ) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.