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

Wireless and Optical Communications Conference

Optimal power allocation for achievable secrecy rate in an untrusted relay network with bounded channel estimation error

Tamer Mekkawy, Rugui Yao, Fei Xu, Ling Wang

Published Apr 1, 2017• 14 citations
Publisher

Abstract

The objective of this paper is to maximize the secrecy rate in an untrusted relay network with imperfect channel state information (CSI). Considering bounded channel estimation error in cooperative jamming network, we optimize the power allocation for confidential and jamming signals to maximize the instantaneous secrecy rate. The upper and lower bounds of achievable secrecy rate are analyzed. The ergodic secrecy rate (ESR) is further derived to evaluate the maximum average secrecy rate. And the optimal power allocation is also studied based on ESR. Numerical results show optimal power allocation can increase both instantaneous secrecy rate and ESR, and at higher SNR, the impact of channel estimation error can be neglected for the maximum ESR, which is asymptotically approaches to the upper bound.

DOI
10.1109/wocc.2017.7929010

Related papers

Joint Power Allocation and Relay Selection Scheme in Multiple Untrusted Relay Networks

Wanying Su, Rugui Yao, Ye Fan +3 more

Untrusted relays might decode the information while forwarding it and lead to threaten the security of the system in some realistic scenarios. The aim of the paper is to maximize the secrecy performance, and therefore on the ground of the cooperative jamming, we propose a novel power allocation-relay selection program in a multi-untrusted relay network where numerous antennas are equipped in the source and the destination simultaneously. Besides, we allow an optimal application of the power allocation factor and the proper selection of the relays, which makes the Ergodic Secrecy Rate (ESR) increased directly. Moreover, the closed-form expressions of the ESR in different scenarios to measure the secrecy performance are acquired. It can be known that the simulation results of the ESR are compliant with the theoretical, especially when Signal-to-Noise Ratio (SNR) is low. Apart from this, the ESR in theoretical values are tested to be approximately equal to the simulation. Compared to other relay selection strategies like partial selection strategy and the Max-Min (MM) selection strategy, the scheme proposed here can get the secrecy performance strengthen better.

IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)•Oct 25, 2022•1 citation

Improving physical layer security in untrusted relay networks: cooperative jamming and power allocation

Lu Lv, Jian Chen, Long Xiang Yang +1 more

The inherent broadcast characteristics of wireless medium make wireless data transmission difficult to be shielded from unintended recipients. As such, secure communication over wireless channels becomes a critical issue in the design of wireless networks. In this study, the authors study cooperative jamming and power optimisation in untrusted relay networks to improve physical layer security. By exploiting the direct link, a source‐based jamming (SBJ) scheme is proposed to hinder the untrusted relay from intercepting the confidential message. Considering the total power budget, a power allocation strategy is also proposed to optimally determine the power of source and untrusted relay as well as the power of information and jamming signals. Furthermore, to evaluate the secrecy performance of the proposed SBJ scheme with the power allocation strategy, tight lower bound of ergodic secrecy capacity and asymptotic secrecy outage probability are derived in closed form. Simulation verifies the advantages of the proposed SBJ scheme and the power allocation strategy.

IET Communications•Jul 20, 2016•57 citations

Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks

Ali Kuhestani, Abbas Mohammadi, Kai‐Kit Wong +3 more

By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination, and an untrusted amplify-and-forward relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas' system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming. Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio regime for the ergodic secrecy rate and the secrecy outage probability. We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.

arXiv:1709.01334•IEEE Transactions on Wireless Communications•Apr 10, 2018•43 citations

Adaptive Jamming Power Control for Untrusted Relay Networks With Imperfect Channel Reciprocity

Kisong Lee, Jun‐Pyo Hong, Hyun-Ho Choi

In an untrusted relay network where a destination transmits a jamming signal to prevent an untrusted relay from recovering the data sent by a source, we consider imperfect channel reciprocity (ICR) between the relay and the destination. This ICR prevents the destination from removing jamming interference perfectly, meaning that transmit power of the jamming signal has a significant impact on the secrecy rate. In this article, we present a system model of an untrusted relay network with ICR, and verify that the secrecy rate is concave with respect to the jamming power. We derive an asymptotic optimal jamming power to maximize the secrecy rate in closed-form and propose an adaptive scheme for jamming power control (JPC). Numerical results show that the proposed JPC scheme achieves a near-optimal secrecy rate, as well as outperforming conventional schemes by controlling the jamming power adaptively. In particular, we note that to improve the secrecy rate, it is advantageous to reduce the jamming power to decrease the residual jamming interference as the reciprocity error increases or the channel between the relay and the destination improves.

IEEE Systems Journal•Sep 5, 2019•9 citations

Joint relay selection and artificial jamming power allocation for secure DF relay networks

Chao Wang, Hui‐Ming Wang

This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.

IEEE International Conference on Communications workshops•Jun 1, 2014•9 citations

Hybrid Opportunistic Relaying and Jamming With Power Allocation for Secure Cooperative Networks

Chao Wang, Hui‐Ming Wang, Xiang‐Gen Xia

This paper studies the cooperative transmission for securing a decode-and-forward (DF) two-hop network where multiple cooperative nodes coexist with a potential eavesdropper. Under the more practical assumption that only the channel distribution information (CDI) of the eavesdropper is known, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen among a collection of N possible candidates to forward the confidential signal and the others send jamming signals to confuse the eavesdroppers. We first investigate the ergodic secrecy rate (ESR) maximization problem by optimizing the power allocation between the confidential signal and jamming signals. In particular, we exploit the limiting distribution technique of extreme order statistics to build an asymptotic closed-form expression of the achievable ESR and the power allocation is optimized to maximize the ESR lower bound. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the Karush-Kuhn-Tucker (KKT) solutions. Furthermore, taking the time variance of the legitimate links' CSIs into consideration, we address the impacts of the outdated CSIs to the proposed secrecy scheme, and derive an asymptotic ESR. Finally, we generalize the analysis to the scenario with multiple eavesdroppers, and give the asymptotic analytical results of the achievable ESR. Simulation results confirm our analytical results.

IEEE Transactions on Wireless Communications•Sep 8, 2014•154 citations
The objective of this paper is to maximize the secrecy rate in an untrusted relay network with imperfect channel state information (CSI). Considering bounded channel estimation error in cooperative jamming network, we optimize the power allocation for confidential and jamming signals to maximize the instantaneous secrecy rate. The upper and lower bounds of achievable secrecy rate are analyzed. The ergodic secrecy rate (ESR) is further derived to evaluate the maximum average secrecy rate. And the optimal power allocation is also studied based on ESR. Numerical results show optimal power allocation can increase both instantaneous secrecy rate and ESR, and at higher SNR, the impact of channel estimation error can be neglected for the maximum ESR, which is asymptotically approaches to the upper bound.
Untrusted relays might decode the information while forwarding it and lead to threaten the security of the system in some realistic scenarios. The aim of the paper is to maximize the secrecy performance, and therefore on the ground of the cooperative jamming, we propose a novel power allocation-relay selection program in a multi-untrusted relay network where numerous antennas are equipped in the source and the destination simultaneously. Besides, we allow an optimal application of the power allocation factor and the proper selection of the relays, which makes the Ergodic Secrecy Rate (ESR) increased directly. Moreover, the closed-form expressions of the ESR in different scenarios to measure the secrecy performance are acquired. It can be known that the simulation results of the ESR are compliant with the theoretical, especially when Signal-to-Noise Ratio (SNR) is low. Apart from this, the ESR in theoretical values are tested to be approximately equal to the simulation. Compared to other relay selection strategies like partial selection strategy and the Max-Min (MM) selection strategy, the scheme proposed here can get the secrecy performance strengthen better.
The inherent broadcast characteristics of wireless medium make wireless data transmission difficult to be shielded from unintended recipients. As such, secure communication over wireless channels becomes a critical issue in the design of wireless networks. In this study, the authors study cooperative jamming and power optimisation in untrusted relay networks to improve physical layer security. By exploiting the direct link, a source‐based jamming (SBJ) scheme is proposed to hinder the untrusted relay from intercepting the confidential message. Considering the total power budget, a power allocation strategy is also proposed to optimally determine the power of source and untrusted relay as well as the power of information and jamming signals. Furthermore, to evaluate the secrecy performance of the proposed SBJ scheme with the power allocation strategy, tight lower bound of ergodic secrecy capacity and asymptotic secrecy outage probability are derived in closed form. Simulation verifies the advantages of the proposed SBJ scheme and the power allocation strategy.
By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination, and an untrusted amplify-and-forward relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas' system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming. Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio regime for the ergodic secrecy rate and the secrecy outage probability. We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.
In an untrusted relay network where a destination transmits a jamming signal to prevent an untrusted relay from recovering the data sent by a source, we consider imperfect channel reciprocity (ICR) between the relay and the destination. This ICR prevents the destination from removing jamming interference perfectly, meaning that transmit power of the jamming signal has a significant impact on the secrecy rate. In this article, we present a system model of an untrusted relay network with ICR, and verify that the secrecy rate is concave with respect to the jamming power. We derive an asymptotic optimal jamming power to maximize the secrecy rate in closed-form and propose an adaptive scheme for jamming power control (JPC). Numerical results show that the proposed JPC scheme achieves a near-optimal secrecy rate, as well as outperforming conventional schemes by controlling the jamming power adaptively. In particular, we note that to improve the secrecy rate, it is advantageous to reduce the jamming power to decrease the residual jamming interference as the reciprocity error increases or the channel between the relay and the destination improves.
This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.
This paper studies the cooperative transmission for securing a decode-and-forward (DF) two-hop network where multiple cooperative nodes coexist with a potential eavesdropper. Under the more practical assumption that only the channel distribution information (CDI) of the eavesdropper is known, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen among a collection of N possible candidates to forward the confidential signal and the others send jamming signals to confuse the eavesdroppers. We first investigate the ergodic secrecy rate (ESR) maximization problem by optimizing the power allocation between the confidential signal and jamming signals. In particular, we exploit the limiting distribution technique of extreme order statistics to build an asymptotic closed-form expression of the achievable ESR and the power allocation is optimized to maximize the ESR lower bound. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the Karush-Kuhn-Tucker (KKT) solutions. Furthermore, taking the time variance of the legitimate links' CSIs into consideration, we address the impacts of the outdated CSIs to the proposed secrecy scheme, and derive an asymptotic ESR. Finally, we generalize the analysis to the scenario with multiple eavesdroppers, and give the asymptotic analytical results of the achievable ESR. Simulation results confirm our analytical results.