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

IET Communications

Secrecy outage performance for partial relay selection schemes in cooperative systems

Yameng Zhou, Gaofeng Pan, Tingting Li, Hequn Liu, Chaoqing Tang, Yunfei Chen

Published Aug 25, 2015• 21 citations
Publisher

Abstract

In this study, secrecy outage performance is studied for partial relay selection (PRS) schemes in cooperative systems over Rayleigh fading channels. In the considered systems, there are one source (S), one destination (D), one eavesdropper, one jammer that can send interference to the eavesdropper, and N ( N > 1) relay candidates, one of which is selected as the relay (R). By considering the practical scenarios and to protect the transmitted information over R–D link from being eavesdropped, the authors propose a new transmission scheme: let D send random information to R while S sending information to R. Then, R processes the messages from S and D by XOR operation in order to prevent the eavesdropper's interception while the information is delivered between R and D. They study the secrecy outage performance for two PRS schemes: (i) the optimal source–relay link (OSRL) scheme; and (ii) the optimal source–relay–destination link (OSRDL) scheme. The closed‐form expressions for the secrecy outage probability (SOP) of the two PRS schemes are derived, as well as the closed‐form upper bound for SOP under OSRL scheme and the lower bound for SOP under OSRDL scheme. Finally, simulation results are given to verify the presented analytical models and the proposed transmission scheme.

DOI
10.1049/iet-com.2015.0109

Related papers

Secrecy Outage of Proactive Relay Selection by Eavesdropper

Sarbani Ghose, Chinmoy Kundu, Octavia A. Dobre

In this paper, we consider an active eavesdropping scenario in a cooperative system consisting of a source, a destination, and an active eavesdropper with multiple decode-and-forward relays. Considering an existing assumption in which an eavesdropper is also a part of network, a proactive relay selection by the eavesdropper is proposed. The best relay which maximizes the eavesdropping rate is selected by the eavesdropper. A relay selection scheme is also proposed to improve the secrecy of the system by minimizing the eavesdropping rate. Performances of these schemes are compared with two passive eavesdropping scenarios in which the eavesdropper performs selection and maximal ratio combining on the relayed links. A realistic channel model with independent non-identical links between nodes and direct links from the source to both the destination and eavesdropper are assumed. Closed- form expressions for the secrecy outage probability (SOP) of these schemes in Rayleigh fading channel are obtained. It is shown that the relay selection by the proactive eavesdropper is most detrimental to the system as not only the SOP increases with the increase in the number of relays, but its diversity also remains unchanged.

arXiv:1803.01065•Globecom•Dec 1, 2017•10 citations

Secrecy Outage Probability of Cooperative Relay Networks with Channel Estimation Error

Yulong Zou, Lidong Cai, Haiyan Guo +1 more

In this paper, we consider a dual-hop decode-and-forward (DF) relay network which consists of a source, a destination and multiple DF relays in the presence of an eavesdropper, where the source transmits its data to the destination with the help of DF relays while the eavesdropper attempts to tap the relay transmissions. We examine the impact of channel estimation errors on the secrecy performance of source-destination transmissions and propose an optimal relay selection scheme for improving the transmission security against eavesdropping. To be specific, the proposed relay selection is designed by considering the fact that the channel state information (CSI) of any link from the source via DF relays to destination is inaccurate with channel estimation errors. The traditional round-robin relay selection is also considered for comparison purposes. We derive close-form expressions of the secrecy outage probability for both the proposed optimal relay selection scheme and traditional round-robin relay selection schemes. Numerical results demonstrate an adverse effect of the channel estimation errors on the secrecy outage probability of cooperative relay systems. Additionally, it is shown that the proposed optimal relay selection scheme substantially outperforms the traditional round-robin selection approach in terms of the secrecy outage probability.

Globecom•Dec 1, 2018•1 citation

Secrecy outage of cooperative relay network with and without eavesdropper's direct link

Khyati Chopra, Ranjan Bose, Anupam Joshi

In this paper, a source communicates to the destination with the cooperation of a relay, in the presence of an eavesdropper. All the links undergo Rayleigh fading and perfect decoding at the relays is not considered. The secrecy outage probability expression is evaluated for a decode-and-forward (DF) dual-hop cooperative relay network, both with and without the presence of direct source to eavesdropper transmission link. The performance of the maximal ratio combining (MRC) and selection combining (SC) diversity at the eavesdropper is investigated. Asymptotic and diversity gain analysis for both the single relay and multi-relay system is obtained, when average SNRs of source-relay and relay-destination links are balanced or unbalanced. We have shown that the increase in target secrecy rate and eavesdropper channel quality significantly affects the outage performance of the system. We have investigated the outage probability of optimal relay selection scheme, when either full instantaneous channel state information (ICSI) or statistical channel state information (SCSI) of all the links is available and have shown that there is improvement in the secrecy performance with the increase in the number of relays.

National Conference on Communications•Mar 1, 2017•1 citation

Physical layer security in cooperative amplify‐and‐forward relay networks over mixed Nakagami‐ m and double Nakagami‐ m fading channels: performance evaluation and optimisation

Anshul Pandey, Suneel Yadav

The authors investigate the secrecy performance of a cooperative relaying network, wherein a fixed source communicates with a fixed destination via an amplify‐and‐forward mobile relay in the presence of a passive mobile eavesdropper. They assume that the source‐to‐relay channel and relay‐to‐destination channel experience Nakagami‐ m fading, whereas relay‐to‐eavesdropper link follows double Nakagami‐ m fading. Under such a mixed fading environment, they derive the novel tight closed‐form expressions for the secrecy outage probability (SOP), probability of non‐zero secrecy capacity, and intercept probability of the considered system. They also deduce the asymptotic secrecy outage and intercept probability expressions in the high signal‐to‐noise ratio regime to highlight the impact of fading parameters and channel conditions on the secrecy diversity order. It is shown that the system can achieve secrecy diversity order of min( ) in terms of SOP, and in terms of intercept probability, where and represent the fading severity parameters between source and relay and between relay and destination, respectively. They also formulate and investigate analytically two optimisation problems, namely, optimal relay location with fixed power allocation and optimal power allocation with fixed relay location, to minimise the system SOP. They verify analytical findings via numerical and simulation results.

IET Communications•Oct 11, 2019•44 citations

Opportunistic Relay Selection for Secrecy Enhancement in Cooperative Networks

Fawaz S. Al‐Qahtani, Caijun Zhong, Hussein Alnuweiri

In this paper, we present a comprehensive investigation on the secrecy performance of opportunistic relay selection systems employing the decode-and-forward protocol over Rayleigh fading channels. Considering a practical setting where direct link between the source node (Alice) and the destination node (Bob) is available, we study the secrecy performance of three different diversity combining schemes, namely, maximum ratio combining (MRC), distributed selection combining (DSC), and distributed switch-and-stay combining (DSSC). Throughout the analysis, we consider two different scenarios based on the availability of the eavesdropper's channel state information (CSI), i.e., Scenario A, where the eavesdropper's CSI is not available at Alice and the relay, and Scenario B, where Alice and the relay have knowledge about the eavesdropper's CSI. For Scenario A, we derive exact closed-form expressions for secrecy outage probability and simple asymptotic approximations for the secrecy outage probability, which enable the characterization of the achievable secrecy diversity order and coding gains. For Scenario B, we derive closed-form expressions for the achievable secrecy rates. For both scenarios, we investigate the impact of feedback delay (outdated CSI) on the secrecy performance wherein exact and asymptotic secrecy outage probability and closed-form expressions of the secrecy achievable rates are obtained. Our analytical findings suggest that both the MRC and DSC schemes achieve the maximum diversity order of K+1 where K is the number of relays. In addition, the feedback delay has a significant impact on the achievable secrecy performance by reducing the achievable diversity order to two.

IEEE Transactions on Communications•Mar 13, 2015•97 citations

Joint relay and jammer selection for secure cooperative networks with a full‐duplex active eavesdropper

He Zhou, Dongxuan He, Hua Wang

In this study, the authors investigate the secure transmission of a cooperative network, in which a source communicates with a destination via multiple cooperative nodes in the presence of a full‐duplex active eavesdropper, which can intercept the confidential signals and transmit jamming signals simultaneously. To safeguard the security of legitimate communication, two joint relay and jammer selection schemes are proposed according to the availability of the eavesdropper's channel state information, namely, optimal relay and random jammer selection scheme and optimal relay and optimal jammer selection scheme. The authors first derive the exact closed‐form expressions of the secrecy outage probability (SOP) for different selection schemes. Aiming at minimising SOP, they then adopt the deep feedforward neural network to determine the optimal power allocation between the selected relay and jammer. Further, the asymptotic expressions for SOP in the high signal‐to‐noise ratio regime are derived. Numerical results verify the analysis and demonstrate the performance advantage of the proposed scheme over conventional relay selection scheme with optimal power allocation.

IET Communications•Feb 2, 2020•9 citations
In this study, secrecy outage performance is studied for partial relay selection (PRS) schemes in cooperative systems over Rayleigh fading channels. In the considered systems, there are one source (S), one destination (D), one eavesdropper, one jammer that can send interference to the eavesdropper, and N ( N > 1) relay candidates, one of which is selected as the relay (R). By considering the practical scenarios and to protect the transmitted information over R–D link from being eavesdropped, the authors propose a new transmission scheme: let D send random information to R while S sending information to R. Then, R processes the messages from S and D by XOR operation in order to prevent the eavesdropper's interception while the information is delivered between R and D. They study the secrecy outage performance for two PRS schemes: (i) the optimal source–relay link (OSRL) scheme; and (ii) the optimal source–relay–destination link (OSRDL) scheme. The closed‐form expressions for the secrecy outage probability (SOP) of the two PRS schemes are derived, as well as the closed‐form upper bound for SOP under OSRL scheme and the lower bound for SOP under OSRDL scheme. Finally, simulation results are given to verify the presented analytical models and the proposed transmission scheme.
In this paper, we consider an active eavesdropping scenario in a cooperative system consisting of a source, a destination, and an active eavesdropper with multiple decode-and-forward relays. Considering an existing assumption in which an eavesdropper is also a part of network, a proactive relay selection by the eavesdropper is proposed. The best relay which maximizes the eavesdropping rate is selected by the eavesdropper. A relay selection scheme is also proposed to improve the secrecy of the system by minimizing the eavesdropping rate. Performances of these schemes are compared with two passive eavesdropping scenarios in which the eavesdropper performs selection and maximal ratio combining on the relayed links. A realistic channel model with independent non-identical links between nodes and direct links from the source to both the destination and eavesdropper are assumed. Closed- form expressions for the secrecy outage probability (SOP) of these schemes in Rayleigh fading channel are obtained. It is shown that the relay selection by the proactive eavesdropper is most detrimental to the system as not only the SOP increases with the increase in the number of relays, but its diversity also remains unchanged.
In this paper, we consider a dual-hop decode-and-forward (DF) relay network which consists of a source, a destination and multiple DF relays in the presence of an eavesdropper, where the source transmits its data to the destination with the help of DF relays while the eavesdropper attempts to tap the relay transmissions. We examine the impact of channel estimation errors on the secrecy performance of source-destination transmissions and propose an optimal relay selection scheme for improving the transmission security against eavesdropping. To be specific, the proposed relay selection is designed by considering the fact that the channel state information (CSI) of any link from the source via DF relays to destination is inaccurate with channel estimation errors. The traditional round-robin relay selection is also considered for comparison purposes. We derive close-form expressions of the secrecy outage probability for both the proposed optimal relay selection scheme and traditional round-robin relay selection schemes. Numerical results demonstrate an adverse effect of the channel estimation errors on the secrecy outage probability of cooperative relay systems. Additionally, it is shown that the proposed optimal relay selection scheme substantially outperforms the traditional round-robin selection approach in terms of the secrecy outage probability.
In this paper, a source communicates to the destination with the cooperation of a relay, in the presence of an eavesdropper. All the links undergo Rayleigh fading and perfect decoding at the relays is not considered. The secrecy outage probability expression is evaluated for a decode-and-forward (DF) dual-hop cooperative relay network, both with and without the presence of direct source to eavesdropper transmission link. The performance of the maximal ratio combining (MRC) and selection combining (SC) diversity at the eavesdropper is investigated. Asymptotic and diversity gain analysis for both the single relay and multi-relay system is obtained, when average SNRs of source-relay and relay-destination links are balanced or unbalanced. We have shown that the increase in target secrecy rate and eavesdropper channel quality significantly affects the outage performance of the system. We have investigated the outage probability of optimal relay selection scheme, when either full instantaneous channel state information (ICSI) or statistical channel state information (SCSI) of all the links is available and have shown that there is improvement in the secrecy performance with the increase in the number of relays.
The authors investigate the secrecy performance of a cooperative relaying network, wherein a fixed source communicates with a fixed destination via an amplify‐and‐forward mobile relay in the presence of a passive mobile eavesdropper. They assume that the source‐to‐relay channel and relay‐to‐destination channel experience Nakagami‐ m fading, whereas relay‐to‐eavesdropper link follows double Nakagami‐ m fading. Under such a mixed fading environment, they derive the novel tight closed‐form expressions for the secrecy outage probability (SOP), probability of non‐zero secrecy capacity, and intercept probability of the considered system. They also deduce the asymptotic secrecy outage and intercept probability expressions in the high signal‐to‐noise ratio regime to highlight the impact of fading parameters and channel conditions on the secrecy diversity order. It is shown that the system can achieve secrecy diversity order of min( ) in terms of SOP, and in terms of intercept probability, where and represent the fading severity parameters between source and relay and between relay and destination, respectively. They also formulate and investigate analytically two optimisation problems, namely, optimal relay location with fixed power allocation and optimal power allocation with fixed relay location, to minimise the system SOP. They verify analytical findings via numerical and simulation results.
In this paper, we present a comprehensive investigation on the secrecy performance of opportunistic relay selection systems employing the decode-and-forward protocol over Rayleigh fading channels. Considering a practical setting where direct link between the source node (Alice) and the destination node (Bob) is available, we study the secrecy performance of three different diversity combining schemes, namely, maximum ratio combining (MRC), distributed selection combining (DSC), and distributed switch-and-stay combining (DSSC). Throughout the analysis, we consider two different scenarios based on the availability of the eavesdropper's channel state information (CSI), i.e., Scenario A, where the eavesdropper's CSI is not available at Alice and the relay, and Scenario B, where Alice and the relay have knowledge about the eavesdropper's CSI. For Scenario A, we derive exact closed-form expressions for secrecy outage probability and simple asymptotic approximations for the secrecy outage probability, which enable the characterization of the achievable secrecy diversity order and coding gains. For Scenario B, we derive closed-form expressions for the achievable secrecy rates. For both scenarios, we investigate the impact of feedback delay (outdated CSI) on the secrecy performance wherein exact and asymptotic secrecy outage probability and closed-form expressions of the secrecy achievable rates are obtained. Our analytical findings suggest that both the MRC and DSC schemes achieve the maximum diversity order of K+1 where K is the number of relays. In addition, the feedback delay has a significant impact on the achievable secrecy performance by reducing the achievable diversity order to two.
In this study, the authors investigate the secure transmission of a cooperative network, in which a source communicates with a destination via multiple cooperative nodes in the presence of a full‐duplex active eavesdropper, which can intercept the confidential signals and transmit jamming signals simultaneously. To safeguard the security of legitimate communication, two joint relay and jammer selection schemes are proposed according to the availability of the eavesdropper's channel state information, namely, optimal relay and random jammer selection scheme and optimal relay and optimal jammer selection scheme. The authors first derive the exact closed‐form expressions of the secrecy outage probability (SOP) for different selection schemes. Aiming at minimising SOP, they then adopt the deep feedforward neural network to determine the optimal power allocation between the selected relay and jammer. Further, the asymptotic expressions for SOP in the high signal‐to‐noise ratio regime are derived. Numerical results verify the analysis and demonstrate the performance advantage of the proposed scheme over conventional relay selection scheme with optimal power allocation.