Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1406.7858

Secrecy Outage Probability of Network-Coded Cooperative Communication

João Luiz Rebelatto, Richard Demo Souza, Rodrigo Tsuneyoshi Kaido, Ohara Kerusauskas Rayel, Bartolomeu Ferreira Uchoa-Filho

Published Jun 30, 2014• 0 citations
arXivHTMLPDF

Abstract

We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with and without channel state information (CSI) at the transmitter side are evaluated. The effectiveness of the proposed schemes is evaluated in terms of secrecy outage probability through theoretic and numerical analyses. It is shown that, even when the legitimate transmitters do not have any CSI, the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

DOI
10.48550/arxiv.1406.7858

Related papers

Secrecy outage probability of network-coded cooperation without channel state information

Marcos Eduardo Pivaro Monteiro, João Luiz Rebelatto, Richard Demo Souza +3 more

We evaluate the secrecy performance of a cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, in a scenario without channel state information (CSI) at the transmitter side. Network coding is leveraged by assuming that the legitimate cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Theoretic and numerical analyses show that the secrecy can be considerably increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

International Symposium on Wireless Communication Systems•Aug 1, 2015•0 citations

Network-coded cooperation for a two-user wiretap channel

Rodrigo Tsuneyoshi Kaido, Ohara Kerusauskas Rayel, João Luiz Rebelatto +1 more

We evaluate the secrecy outage probability of a two-user network-coded cooperative network in the presence of an eavesdropper. We show through theoretic and numerical analyses that the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•2 citations

Cooperation for Secrecy in Wireless Networks

Frédéric Gabry

The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, there has been a recent surge of interest in a potential cooperation between users to enhance the secrecy of communications. In this thesis we investigate the interaction between cooperation and secrecy. In particular the contributions of the thesis can be divided into two parts. In the first part, we study cooperative strategies for secrecy for wireless channels. Our goal is to evaluate the effect of fading and limited CSI on the eavesdropper’s channels. In that purpose we consider a scenario where a helper aims at increasing the secrecy of the communication between a source and destination in the presence of an eavesdropper. Several strategies are discussed for the helper, namely decode-and-forward, amplify-and-forward, and cooperative jamming. We introduce the secrecy outage probability, the conditional secrecy outage probability and the secure throughput as secrecy measures. For each measure, we investigate and compare the secrecy performance of cooperation. We furthermore elaborate a system optimization in terms of strategy selection, node positioning, power allocation and rate design. In the second part, we consider cooperation in the 4-node scenario against a more sophisticated adversary: an active eavesdropper, which can either passively eavesdrop, or jam the transmission. A game-theoretic perspective is a natural way to analyze the competitive interaction between the helper and the eavesdropper. Therefore we define several secrecy games, for which we find the Nash and Stackelberg equilibria as well as the corresponding secrecy rate outcomes. Another important consideration in this scenario is the interaction between the source and the helper, which we model and solve as a Stackelberg game, and we illustrate its impact on the achievable secrecy rates.

•Jan 1, 2012•5 citations

Cooperative-Jamming-Aided Secrecy Enhancement in Wireless Networks With Passive Eavesdroppers

Lin Hu, Hong Wen, Bin Wu +3 more

This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.

IEEE Transactions on Vehicular Technology•Aug 25, 2017•78 citations

Outage performance of secure cooperative systems over correlated Rayleigh fading channels

Ying Xu, Kun Xiao

This paper investigates the outage performance of the secure cooperative system over correlated Rayleigh fading channels in the presence of the eavesdropper and the jammer. Assuming that the transmitter knows the full channel state information (CSI) before transmission, there exist one eavesdropper and multiple cooperative relay nodes in system, and a relay node is chosen to act as jammer to send the jamming signals. We consider two typical scenarios: 1) the legitimate channel is correlated with the jamming channel to the destination, while the wiretap channel is independent of the jamming channel to the eavesdropper, and 2) the wiretap channel is correlated with the jamming channel to the eavesdropper, while the legitimate channel is independent of the jamming channel to the destination. For each scenario, we derive the expression of secrecy outage probability of the proposed secure cooperative system, respectively. Numerical results show that the channel correlation has significant impacts on the secrecy outage probability of the secure cooperative system.

Wireless and Optical Communications Conference•May 1, 2016•3 citations

Performance Analysis of Cooperative Communication System

Wei ZHANG, Xianyi Rui

The traditional relay selection scheme only considers the channel state information (CSI) of legitimate users, and does not consider the power allocation between the source node and relay node. However, in the actual transmission system, there will be potential eavesdropper, and the traditional relay selection scheme will greatly reduce the security of the system. In this letter, we evaluate the secrecy outage probability (SOP) of relay selection scheme with a decode-and-forward (DF) protocol over independent and non-identically distributed Rayleigh fading. With the CSI of eavesdropper and the power allocation of source node and relay nodes are considered, the secrecy performance of cooperative communication system can be improved effectively.

DEStech Transactions on Computer Science and Engineering•Jul 27, 2017•0 citations
We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with and without channel state information (CSI) at the transmitter side are evaluated. The effectiveness of the proposed schemes is evaluated in terms of secrecy outage probability through theoretic and numerical analyses. It is shown that, even when the legitimate transmitters do not have any CSI, the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.
We evaluate the secrecy performance of a cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, in a scenario without channel state information (CSI) at the transmitter side. Network coding is leveraged by assuming that the legitimate cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Theoretic and numerical analyses show that the secrecy can be considerably increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.
The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, there has been a recent surge of interest in a potential cooperation between users to enhance the secrecy of communications. In this thesis we investigate the interaction between cooperation and secrecy. In particular the contributions of the thesis can be divided into two parts. In the first part, we study cooperative strategies for secrecy for wireless channels. Our goal is to evaluate the effect of fading and limited CSI on the eavesdropper’s channels. In that purpose we consider a scenario where a helper aims at increasing the secrecy of the communication between a source and destination in the presence of an eavesdropper. Several strategies are discussed for the helper, namely decode-and-forward, amplify-and-forward, and cooperative jamming. We introduce the secrecy outage probability, the conditional secrecy outage probability and the secure throughput as secrecy measures. For each measure, we investigate and compare the secrecy performance of cooperation. We furthermore elaborate a system optimization in terms of strategy selection, node positioning, power allocation and rate design. In the second part, we consider cooperation in the 4-node scenario against a more sophisticated adversary: an active eavesdropper, which can either passively eavesdrop, or jam the transmission. A game-theoretic perspective is a natural way to analyze the competitive interaction between the helper and the eavesdropper. Therefore we define several secrecy games, for which we find the Nash and Stackelberg equilibria as well as the corresponding secrecy rate outcomes. Another important consideration in this scenario is the interaction between the source and the helper, which we model and solve as a Stackelberg game, and we illustrate its impact on the achievable secrecy rates.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
This paper investigates the outage performance of the secure cooperative system over correlated Rayleigh fading channels in the presence of the eavesdropper and the jammer. Assuming that the transmitter knows the full channel state information (CSI) before transmission, there exist one eavesdropper and multiple cooperative relay nodes in system, and a relay node is chosen to act as jammer to send the jamming signals. We consider two typical scenarios: 1) the legitimate channel is correlated with the jamming channel to the destination, while the wiretap channel is independent of the jamming channel to the eavesdropper, and 2) the wiretap channel is correlated with the jamming channel to the eavesdropper, while the legitimate channel is independent of the jamming channel to the destination. For each scenario, we derive the expression of secrecy outage probability of the proposed secure cooperative system, respectively. Numerical results show that the channel correlation has significant impacts on the secrecy outage probability of the secure cooperative system.
The traditional relay selection scheme only considers the channel state information (CSI) of legitimate users, and does not consider the power allocation between the source node and relay node. However, in the actual transmission system, there will be potential eavesdropper, and the traditional relay selection scheme will greatly reduce the security of the system. In this letter, we evaluate the secrecy outage probability (SOP) of relay selection scheme with a decode-and-forward (DF) protocol over independent and non-identically distributed Rayleigh fading. With the CSI of eavesdropper and the power allocation of source node and relay nodes are considered, the secrecy performance of cooperative communication system can be improved effectively.