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

Globecom

Optimizing Secrecy Performance of Trusted RF Relay against External Eavesdropping

Venugopalachary Kotha, Deepak Mishra, Ravikant Saini, Vijay Kumar Chakka

Published Dec 1, 2019• 2 citations
Publisher

Abstract

In resource allocation for secure cooperative communication systems, along with power allocation, relay placement also has equal importance in improving the system performance. In this paper, we study the joint optimization of relay placement and power allocation to minimize the secrecy outage probability (SOP) for a four-node cooperative system with a trusted randomize-and-forward relay in the presence of an external eavesdropper. Initially, we derive the expression of SOP, and then formulate an optimization problem to minimize SOP under given power budget and relay placement (RP) constraints. By providing analytical insights on power allocation (PA) between source and relay, we obtain closed form expressions of optimal PA (OPA) for a given RP that minimizes the SOP. Next, we propose a low complexity algorithm to obtain the near-optimal RP (ORP) for a given PA. Finally, we obtain optimal SOP with joint RP and PA. Numerical results present validation of analytical SOP through Monte Carlo simulations, optimal PA for a given RP, optimal RP for a given PA, and joint PA and RP for a given secrecy threshold rate. Finally, we highlight the significant performance gains achieved by the joint design over the conventional scheme.

DOI
10.1109/globecom38437.2019.9013579

Related papers

Outage Constrained Secrecy Rate Maximization for Relay Networks against Unknown Eavesdroppers

Qian Xu, Pinyi Ren, Qinghe Du +2 more

Relay transmission can expand the coverage area and improve the communication reliability. However, it may face higher eavesdropping risk due to the additional relay-destination retransmission, which provides eavesdroppers with a second chance to intercept the confidential message. To guarantee the communication secrecy, specially designed transmission strategies are needed. In this paper, we concentrate on the secrecy assurance of a relay network, which is surrounded by colluding eavesdroppers with unknown locations. Specifically, we aim to maximize the secrecy rate by jointly optimizing the power allocation and relay placement. First, we derive the exact expression of the secrecy outage probability. After imposing a constraint on the outage probability, we formulate a secrecy-rate- maximization problem, which is difficult to solve. By using an upper bound, we transform the original problem into a new one, the solution to which is also feasible for the original problem. We then obtain the optimal power allocation between the source and the relay and find the relay's best location to maximize the secrecy rate. It is noted that the derived optimal power allocation is independent of the instantaneous channel state information (CSI), which avoids the frequent change of transmit power and lowers the system complexity. Finally, numerical results are presented to validate our analyses.

IEEE Wireless Communications and Networking Conference•Mar 1, 2017•1 citation

Secure Communications With Cooperative Jamming: Optimal Power Allocation and Secrecy Outage Analysis

Kanapathippillai Cumanan, George C. Alexandropoulos, Zhiguo Ding +1 more

This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.

arXiv:1701.03383•IEEE Transactions on Vehicular Technology•Jan 24, 2017•91 citations

Power Optimization for Enhancing Secrecy of Cooperative User Relaying NOMA Networks

Yang Cao, Shuai Wang, Minglu Jin +4 more

To enhance the secrecy of wireless transmission, we propose a cooperative user relaying NOMA scheme, in which the near user works in full-duplex mode by transmitting jamming signals and receiving desired signals in the first phase, and the base station sends jamming signals in the second phase. Two power allocation (PA) schemes between the legitimate and jamming signals are designed based on different knowledge of the eavesdropping channel state information (ECSI). The first scheme aims to jam the eavesdropping with highest power while meeting rate requirements without ECSI. In the second scheme, the closed-form expressions of secrecy outage probability (SOP) are first derived using the statistical ECSI. Then, the sum secrecy rate is maximized by optimizing the PA and redundant rate with SOP constraints. Simulation results are provided to show the effectiveness of the proposed schemes.

IEEE Transactions on Vehicular Technology•May 6, 2020•16 citations

Exact Outage Analysis for Non-regenerative Secure Cooperation Against Double-tap Eavesdropping

Venugopalachary Kotha, Deepak Mishra, Ravikant Saini

This paper presents the secrecy performance analysis of an amplify-and-forward relay-assisted cooperative communication system in the presence of a passive external eavesdropper. In contrast to existing works that assume high signal-to-noise ratio (SNR) approximations, we have investigated exact and secrecy outage probabilities. Furthermore, we consider a more challenging scenario where the source may not be reachable to the intended user directly. But the eavesdropper can tap both the source link and the relay link. First of all, the outage probability is analyzed at the intended user as well as the eavesdropper. Next, defining the secrecy rate for the amplify-and-forward (AF) relaying system, the expression of the secrecy outage probability (SOP) and the secrecy intercept probability (SIP) have been derived, respectively. Noticing the complexity involved in the integration of SOP and SIP expressions, the closed-form expressions have been derived for asymptotic cases. Finally, the exact and asymptotic analysis has been verified by performing Monte-Carlo simulations. It is observed that the relay position should be closer to the source compared to the eavesdropper to achieve improved SOP.

Híradástechnika/Infocommunications journal•Jan 1, 2022•1 citation

Relay selection for optimized cooperative jamming scheme

Asma Mabrouk, Kamel Tourki, Noureddine Hamdi

In this paper, we study the problem of secure dual-hop transmission in the presence of an eavesdropper, where a secrecy-enhanced relay selection as well as a destination cooperation are presented to prevent the source information from being eavesdropped. Taking into account the total power budget, a power allocation scheme is investigated to optimize the destination contribution. We present the system performance in terms of secrecy capacity where we derive a closed form expression for its lower bound. Simulation results reveal that a higher power allocation to the jamming signal should be balanced by a closer placement of the relay to the source to get better system performance, and vice versa.

European Signal Processing Conference (EUSIPCO)•Aug 1, 2015•14 citations

Impact of Relay’s Eavesdropping on Untrusted Amplify-and-Forward Networks Over Nakagami- $m$ Fading

Fan Ding, Hui Wang, Yongming Zhou +1 more

We investigate the impact of eavesdropping on the secrecy outage performance of dual-hop amplify-and-forward networks with a single untrusted relay, in which cooperative jamming technique is employed at the destination to realize positive secrecy rate. Under Nakagami-m fading channels, we derive tight closed-form and asymptotic expressions for the lower and upper bounds of the secrecy outage probability (SOP). Our results explicitly show that a secrecy diversity order of min(m1, m2/2) in terms of the SOP is achieved, where m1and m2are the respective integer fading parameters of the source-relay and relay-destination links. Afterwards, we propose an asymptotically optimal power allocation (OPA) scheme that minimizes the SOP. Numerical and simulation results show that the proposed OPA offers significant improvement on the SOP performance, especially in the case of m1> m2/2.

IEEE Wireless Communications Letters•Sep 26, 2017•13 citations
In resource allocation for secure cooperative communication systems, along with power allocation, relay placement also has equal importance in improving the system performance. In this paper, we study the joint optimization of relay placement and power allocation to minimize the secrecy outage probability (SOP) for a four-node cooperative system with a trusted randomize-and-forward relay in the presence of an external eavesdropper. Initially, we derive the expression of SOP, and then formulate an optimization problem to minimize SOP under given power budget and relay placement (RP) constraints. By providing analytical insights on power allocation (PA) between source and relay, we obtain closed form expressions of optimal PA (OPA) for a given RP that minimizes the SOP. Next, we propose a low complexity algorithm to obtain the near-optimal RP (ORP) for a given PA. Finally, we obtain optimal SOP with joint RP and PA. Numerical results present validation of analytical SOP through Monte Carlo simulations, optimal PA for a given RP, optimal RP for a given PA, and joint PA and RP for a given secrecy threshold rate. Finally, we highlight the significant performance gains achieved by the joint design over the conventional scheme.
Relay transmission can expand the coverage area and improve the communication reliability. However, it may face higher eavesdropping risk due to the additional relay-destination retransmission, which provides eavesdroppers with a second chance to intercept the confidential message. To guarantee the communication secrecy, specially designed transmission strategies are needed. In this paper, we concentrate on the secrecy assurance of a relay network, which is surrounded by colluding eavesdroppers with unknown locations. Specifically, we aim to maximize the secrecy rate by jointly optimizing the power allocation and relay placement. First, we derive the exact expression of the secrecy outage probability. After imposing a constraint on the outage probability, we formulate a secrecy-rate- maximization problem, which is difficult to solve. By using an upper bound, we transform the original problem into a new one, the solution to which is also feasible for the original problem. We then obtain the optimal power allocation between the source and the relay and find the relay's best location to maximize the secrecy rate. It is noted that the derived optimal power allocation is independent of the instantaneous channel state information (CSI), which avoids the frequent change of transmit power and lowers the system complexity. Finally, numerical results are presented to validate our analyses.
This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.
To enhance the secrecy of wireless transmission, we propose a cooperative user relaying NOMA scheme, in which the near user works in full-duplex mode by transmitting jamming signals and receiving desired signals in the first phase, and the base station sends jamming signals in the second phase. Two power allocation (PA) schemes between the legitimate and jamming signals are designed based on different knowledge of the eavesdropping channel state information (ECSI). The first scheme aims to jam the eavesdropping with highest power while meeting rate requirements without ECSI. In the second scheme, the closed-form expressions of secrecy outage probability (SOP) are first derived using the statistical ECSI. Then, the sum secrecy rate is maximized by optimizing the PA and redundant rate with SOP constraints. Simulation results are provided to show the effectiveness of the proposed schemes.
This paper presents the secrecy performance analysis of an amplify-and-forward relay-assisted cooperative communication system in the presence of a passive external eavesdropper. In contrast to existing works that assume high signal-to-noise ratio (SNR) approximations, we have investigated exact and secrecy outage probabilities. Furthermore, we consider a more challenging scenario where the source may not be reachable to the intended user directly. But the eavesdropper can tap both the source link and the relay link. First of all, the outage probability is analyzed at the intended user as well as the eavesdropper. Next, defining the secrecy rate for the amplify-and-forward (AF) relaying system, the expression of the secrecy outage probability (SOP) and the secrecy intercept probability (SIP) have been derived, respectively. Noticing the complexity involved in the integration of SOP and SIP expressions, the closed-form expressions have been derived for asymptotic cases. Finally, the exact and asymptotic analysis has been verified by performing Monte-Carlo simulations. It is observed that the relay position should be closer to the source compared to the eavesdropper to achieve improved SOP.
In this paper, we study the problem of secure dual-hop transmission in the presence of an eavesdropper, where a secrecy-enhanced relay selection as well as a destination cooperation are presented to prevent the source information from being eavesdropped. Taking into account the total power budget, a power allocation scheme is investigated to optimize the destination contribution. We present the system performance in terms of secrecy capacity where we derive a closed form expression for its lower bound. Simulation results reveal that a higher power allocation to the jamming signal should be balanced by a closer placement of the relay to the source to get better system performance, and vice versa.
Impact of Relay’s Eavesdropping on Untrusted Amplify-and-Forward Networks Over Nakagami- mmm Fading
We investigate the impact of eavesdropping on the secrecy outage performance of dual-hop amplify-and-forward networks with a single untrusted relay, in which cooperative jamming technique is employed at the destination to realize positive secrecy rate. Under Nakagami-m fading channels, we derive tight closed-form and asymptotic expressions for the lower and upper bounds of the secrecy outage probability (SOP). Our results explicitly show that a secrecy diversity order of min(m1, m2/2) in terms of the SOP is achieved, where m1and m2are the respective integer fading parameters of the source-relay and relay-destination links. Afterwards, we propose an asymptotically optimal power allocation (OPA) scheme that minimizes the SOP. Numerical and simulation results show that the proposed OPA offers significant improvement on the SOP performance, especially in the case of m1> m2/2.