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

The University of Danang - Journal of Science and Technology

Secrecy Rate and Optimal Power Allocation of the Amplify-and-Forward Relay Wire-Tap System

Cuong Hung Dang, Leonardo Jimenez Rodriguez, Nghi Huu Tran, Forrest Sheng Bao, Shivakumar Sastry

Published Aug 31, 2016• 0 citations
Publisher

Abstract

In this research work, we investigate the secrecy rate and optimal power allocation schemes for a half-duplex (HD) wire-tap Rayleigh fading channel in which a source wishes to communicate securely to a destination in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay. The secrecy capacity and the corresponding optimal power allocation schemes are examined under both individual and joint power constraints. Due to the absence of an insightful expression of the secrecy rate for a given power allocation scheme, determining such secrecy capacity is challenging. To overcome this issue, we first propose a novel method to calculate the expectation of an exponentially distributed random variable using the exponential integral function. By exploiting this calculation, we then establish the average secrecy rate of the considered AF relay channel in closed-form. By examining the quasi-concavity of the optimal power allocation problem, it is then concluded that the problem is quasi-concave. As such, the globally optimal solution exists and is unique for both individual and joint power constraints. A simple root finding method then can be applied into the derived close-formed formula to approximately calculate the optimal power allocation scheme to achieve the secrecy capacity. Numerical results are then provided to confirm the accuracy of the derived formula and the optimality of the proposed power allocation.

DOI
10.31130/jst.2016.19

Related papers

Secrecy capacity of the full-duplex AF relay wire-tap channel under residual self-interference

Cuong Hung Dang, Leonardo Jiménez Rodríguez, Nghi Huu Tran +2 more

This paper studies a wire-tap channel in which a source node wants to communicate securely to a destination node in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay operating in full-duplex (FD) mode. The residual self-interference due to FD transmission is explicitly taken into account. The secrecy capacity and the respective optimal power allocation schemes for this system are examined under both individual and joint power constraints. At first, the related optimization problems are shown to be quasi-concave. As such, the globally optimal solution exists and is unique. Due to the non-linearity of the derivative, we apply a simple bisection method for root finding and obtain a simple expression for the optimal power allocation scheme. To further provide some insight on the solutions, we apply the method of dominant balance to analyze the capacity and power allocations in different high power regions. It is then demonstrated that full relay power is only needed when the power at the relay is sufficiently small compared to the power at the source. Comparisons with half-duplex (HD) relaying also revealed that FD can achieve a significantly higher secrecy capacity. Finally, numerical results are presented to confirm the optimality of the solutions.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•14 citations

Optimal power allocation schemes for single-relay af wire-tap channels

Leonardo Jimenez Rodriguez, Nghi Huu Tran, Tho Le‐Ngoc

This paper considers the wire-tap channel in which a source node communicates to a destination node with the help of a single amplify-and-forward (AF) relay and in the presence of an eavesdropper. The secrecy capacity and respective optimal power allocation scheme at the source and relay are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered. These include combinations of dual-hop, orthogonal AF and direct transmission schemes. To deal with the non-concave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. It is then shown that the power allocation strategies that maximize the secrecy rates can be obtained in closed form. Simulation results are finally provided to verify the optimality of the proposed schemes.

International Conference on Communications and Electronics (ICCE)•Jul 1, 2014•4 citations

Optimal Power Allocation Schemes for the Single AF Relay and Jammer Wiretap Channels

Leonardo Jiménez Rodríguez, Nghi Huu Tran, Tho Le‐Ngoc

This paper considers the wiretap channel in which a source node communicates with a destination node with the aid of a single helper and in the presence of an eavesdropper. The helper can apply either amplify-and-forward (AF) relaying or jamming. The secrecy capacity and respective optimal power allocation schemes at the source and the helper are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered for relaying. To deal with the related nonconcave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. Using this approach, optimal power allocation strategies are derived for some relay topologies and for the jamming system. Insights into the proposed schemes for different transmission power ranges and comparisons to the optimal information rate power allocations are also discussed. Simulation results are finally provided to quantify the optimality of the proposed schemes.

IEEE Transactions on Vehicular Technology•Jun 10, 2015•10 citations

PHYSICAL-LAYER SECURITY WITH FULL-DUPLEX DECODE-AND-FORWARD RELAYING: SECRECY RATES AND POWER ALLOCATION

Lubna Elsaid

This thesis studies the secrecy rate and respective optimal power allocation schemes to maximize the secrecy rate of a full-duplex (FD) relay wiretap channel.The FD relay is assumed to operate in decode-and-forward (DF) mode to support a secured communication from a source to a destination under the presence of an eavesdropper.Both slowly varying fading and ergodic fading channels where the channel gains are assumed to be available at the receivers but not the transmitters are considered.The residual self-interference due to FD transmission is taken into account in formulating the secrecy rate and the optimal power allocation schemes.The first part of the thesis establishes closed-form expressions of the secrecy rates for a given power allocation scheme at the source and the relay.For a slowly varying fading environment, the channel conditions for which a positive secrecy rate is attained are identified.In the case of ergodic fading, we first propose a simple method to calculate the expectation of an exponentially distributed random variable using the exponential integral function.Using this result, the ergodic secrecy rates of the considered FD relay channel are then established in closed-form.The proposed method provides a simple yet effective way to compute the secrecy rates without the need of lengthy Monte Carlo simulations.iii I am grateful to my advisor, Dr. Nghi H. Tran, for the kindness he showed me, his understanding to my situation and his knowledgeable and experienced guidance throughout this masters.This work could not have been possible without my loving, sweet and generous husband, Abdo, who supported and encouraged me in every step of the way and was the light that guided me through my darkest

•Jan 1, 2016•0 citations

On the Secrecy Performance and Power Allocation in Relaying Networks With Untrusted Relay in the Partial Secrecy Regime

Diana Pamela Moya Osorio, Hirley Alves, Edgar Eduardo Benítez Olivo

Recently, three useful secrecy metrics based on the partial secrecy regime were proposed to analyze secure transmissions on wireless systems over quasi-static fading channels, namely: generalized secrecy outage probability, average fractional equivocation, and average information leakage. These metrics were devised from the concept of fractional equivocation, which is related to the decoding error probability at the eavesdropper, so as to provide a comprehensive insight on the practical implementation of wireless systems with different levels of secrecy requirements. Considering the partial secrecy regime, in this paper we examine the secrecy performance of an amplify-and-forward relaying network with an untrusted relay node, where a destination-based jamming is employed to enable secure transmissions. In this regard, a closed-form approximation is derived for the generalized secrecy outage probability, and integral-form expressions are obtained for the average fractional equivocation and the average information leakage rate. Additionally, equal and optimal power allocation schemes are investigated and compared for the three metrics. From this analysis, we show that different power allocation approaches lead to different system design criteria. The obtained expressions are validated via Monte Carlo simulations.

arXiv:1912.03853•IEEE Transactions on Information Forensics and Security•Dec 17, 2019•18 citations

Joint Source-Relay Precoding and Power Allocation for Secure Amplify-and-Forward MIMO Relay Networks

Hui‐Ming Wang, Feng Liu, Xiang‐Gen Xia

In this paper, we investigate the security issue of a two-hop amplify-and-forward multiple-input multiple-output wireless relay network in the existence of a multiantenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a nonconvex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate with a tractable complexity, we propose a suboptimal joint source and relay linear precoding and power allocation scheme. In the scheme, the source node adopts a generalized singular value decomposition (SVD)-based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on the SVD precoding in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate by an alternating iterative optimization algorithm. Each iteration involves two subproblems. One has a water-filling solution and the other has a closed-form solution or a water-filling-like solution as well, both of which are computationally very efficient. The iteration converges fast and we prove that it guarantees to find a stationary optimum. Furthermore, we show that when the eavesdropper has equal or more antennas than the source does, the secrecy rate is a quasi-concave function of the source power so that allocating all the source power is generally not optimal. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.

IEEE Transactions on Information Forensics and Security•May 30, 2014•56 citations
In this research work, we investigate the secrecy rate and optimal power allocation schemes for a half-duplex (HD) wire-tap Rayleigh fading channel in which a source wishes to communicate securely to a destination in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay. The secrecy capacity and the corresponding optimal power allocation schemes are examined under both individual and joint power constraints. Due to the absence of an insightful expression of the secrecy rate for a given power allocation scheme, determining such secrecy capacity is challenging. To overcome this issue, we first propose a novel method to calculate the expectation of an exponentially distributed random variable using the exponential integral function. By exploiting this calculation, we then establish the average secrecy rate of the considered AF relay channel in closed-form. By examining the quasi-concavity of the optimal power allocation problem, it is then concluded that the problem is quasi-concave. As such, the globally optimal solution exists and is unique for both individual and joint power constraints. A simple root finding method then can be applied into the derived close-formed formula to approximately calculate the optimal power allocation scheme to achieve the secrecy capacity. Numerical results are then provided to confirm the accuracy of the derived formula and the optimality of the proposed power allocation.
This paper studies a wire-tap channel in which a source node wants to communicate securely to a destination node in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay operating in full-duplex (FD) mode. The residual self-interference due to FD transmission is explicitly taken into account. The secrecy capacity and the respective optimal power allocation schemes for this system are examined under both individual and joint power constraints. At first, the related optimization problems are shown to be quasi-concave. As such, the globally optimal solution exists and is unique. Due to the non-linearity of the derivative, we apply a simple bisection method for root finding and obtain a simple expression for the optimal power allocation scheme. To further provide some insight on the solutions, we apply the method of dominant balance to analyze the capacity and power allocations in different high power regions. It is then demonstrated that full relay power is only needed when the power at the relay is sufficiently small compared to the power at the source. Comparisons with half-duplex (HD) relaying also revealed that FD can achieve a significantly higher secrecy capacity. Finally, numerical results are presented to confirm the optimality of the solutions.
This paper considers the wire-tap channel in which a source node communicates to a destination node with the help of a single amplify-and-forward (AF) relay and in the presence of an eavesdropper. The secrecy capacity and respective optimal power allocation scheme at the source and relay are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered. These include combinations of dual-hop, orthogonal AF and direct transmission schemes. To deal with the non-concave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. It is then shown that the power allocation strategies that maximize the secrecy rates can be obtained in closed form. Simulation results are finally provided to verify the optimality of the proposed schemes.
This paper considers the wiretap channel in which a source node communicates with a destination node with the aid of a single helper and in the presence of an eavesdropper. The helper can apply either amplify-and-forward (AF) relaying or jamming. The secrecy capacity and respective optimal power allocation schemes at the source and the helper are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered for relaying. To deal with the related nonconcave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. Using this approach, optimal power allocation strategies are derived for some relay topologies and for the jamming system. Insights into the proposed schemes for different transmission power ranges and comparisons to the optimal information rate power allocations are also discussed. Simulation results are finally provided to quantify the optimality of the proposed schemes.
This thesis studies the secrecy rate and respective optimal power allocation schemes to maximize the secrecy rate of a full-duplex (FD) relay wiretap channel.The FD relay is assumed to operate in decode-and-forward (DF) mode to support a secured communication from a source to a destination under the presence of an eavesdropper.Both slowly varying fading and ergodic fading channels where the channel gains are assumed to be available at the receivers but not the transmitters are considered.The residual self-interference due to FD transmission is taken into account in formulating the secrecy rate and the optimal power allocation schemes.The first part of the thesis establishes closed-form expressions of the secrecy rates for a given power allocation scheme at the source and the relay.For a slowly varying fading environment, the channel conditions for which a positive secrecy rate is attained are identified.In the case of ergodic fading, we first propose a simple method to calculate the expectation of an exponentially distributed random variable using the exponential integral function.Using this result, the ergodic secrecy rates of the considered FD relay channel are then established in closed-form.The proposed method provides a simple yet effective way to compute the secrecy rates without the need of lengthy Monte Carlo simulations.iii I am grateful to my advisor, Dr. Nghi H. Tran, for the kindness he showed me, his understanding to my situation and his knowledgeable and experienced guidance throughout this masters.This work could not have been possible without my loving, sweet and generous husband, Abdo, who supported and encouraged me in every step of the way and was the light that guided me through my darkest
Recently, three useful secrecy metrics based on the partial secrecy regime were proposed to analyze secure transmissions on wireless systems over quasi-static fading channels, namely: generalized secrecy outage probability, average fractional equivocation, and average information leakage. These metrics were devised from the concept of fractional equivocation, which is related to the decoding error probability at the eavesdropper, so as to provide a comprehensive insight on the practical implementation of wireless systems with different levels of secrecy requirements. Considering the partial secrecy regime, in this paper we examine the secrecy performance of an amplify-and-forward relaying network with an untrusted relay node, where a destination-based jamming is employed to enable secure transmissions. In this regard, a closed-form approximation is derived for the generalized secrecy outage probability, and integral-form expressions are obtained for the average fractional equivocation and the average information leakage rate. Additionally, equal and optimal power allocation schemes are investigated and compared for the three metrics. From this analysis, we show that different power allocation approaches lead to different system design criteria. The obtained expressions are validated via Monte Carlo simulations.
In this paper, we investigate the security issue of a two-hop amplify-and-forward multiple-input multiple-output wireless relay network in the existence of a multiantenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a nonconvex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate with a tractable complexity, we propose a suboptimal joint source and relay linear precoding and power allocation scheme. In the scheme, the source node adopts a generalized singular value decomposition (SVD)-based precoding to transmit the signal in the first phase, and the relay node forwards the received signal based on the SVD precoding in the null-space of the wiretap channel in the second phase. Power allocations in both phases are optimized to maximize the secrecy rate by an alternating iterative optimization algorithm. Each iteration involves two subproblems. One has a water-filling solution and the other has a closed-form solution or a water-filling-like solution as well, both of which are computationally very efficient. The iteration converges fast and we prove that it guarantees to find a stationary optimum. Furthermore, we show that when the eavesdropper has equal or more antennas than the source does, the secrecy rate is a quasi-concave function of the source power so that allocating all the source power is generally not optimal. Numerical evaluation results are provided to show the effectiveness of the iterative algorithm and the proposed secrecy scheme.