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

International Journal of Communication Systems

Enhancing secrecy capacity of multi‐relay wiretap systems with partial channel state information

Hang Long, Wei Xiang, Jing Wang, Xiaoli Zhang, Wenbo Wang

Published Apr 24, 2014• 3 citations
Publisher

Abstract

Summary Distributed precoding has provento be capable of enhancing the secrecy capacity of the multi‐relay wiretap system. An iterative distributed precoding and channel state information (CSI) sharing scheme can be used to reduce the CSI overhead at each relay node. However, in practical applications, the CSI of each relay node cannot be perfectly known to themselves, especially that of the relay‐eavesdropper channels. Thus, partial CSI for the relay‐eavesdropper links is assumed, and the corresponding distributed precoding and CSI sharing schemes are investigated. Under the assumption that the average value of the relay‐eavesdropper channel is known at each relay node, an extended iterative distributed precoding and CSI sharing scheme is proposed. Simulation results demonstrate that with the increase of the power ratio of the constant part to the random part of the relay‐eavesdropper channels, the proposed scheme with partial CSI performs increasingly close to the one with perfect CSI in secrecy capacity. Copyright © 2014 John Wiley & Sons, Ltd.

DOI
10.1002/dac.2802

Related papers

Secrecy Capacity Enhancement With Distributed Precoding in Multirelay Wiretap Systems

Hang Long, Wei Xiang, Yueying Zhang +2 more

The secrecy capacity of relay communications is investigated in this paper, where an eavesdropper is present. Distributed precoding through multiple relay nodes can be used to enhance the received signal power at the destination node and to mitigate the signal leakage to the eavesdropper, simultaneously. Due to individual power constraints at relay nodes, the distributed precoding scalar at each relay node is equivalent to a distributed precoding angle. An iterative algorithm is proposed to find the suboptimum distributed precoding angles at all the relay nodes, where the channel state information (CSI) sharing overhead among the relay nodes can also be substantially reduced. Each relay node receives the equivalent CSI from its preceding relay node, computes its distributed precoding angle, and updates the equivalent CSI for the next relay node. Compared with the simple decode-and-forward relaying protocol with random distributed precoding, the proposed iterative distributed precoding algorithm is able to further improve on the secrecy capacity of the multirelay wiretap system with an acceptable CSI sharing overhead.

IEEE Transactions on Information Forensics and Security•Nov 27, 2012•44 citations

Distributed precoding in multi-relay wiretap systems with amplify-and-forward

Jing Wang, Xiaoting Wang, Qianghua Guo +2 more

The security of the multi-relay wiretap system with an eavesdropper is investigated in this paper, where the amplify-and-forward (AF) relaying protocol is used. Appropriate distributed precoding design at the relay nodes can be utilized to guarantee the secure communication, which means maximizing the ratio of received signal power at the destination node and the eavesdropper node. In decode-and-forward relaying systems, an iterative algorithm has been proposed to find sub-optimum distributed precoding angles at all the relay nodes [1]. In this paper, this algorithm is extended to be used in AF systems with some modifications. In the algorithm, after receiving the equivalent channel state information (CSI) from the last relay node, the current relay node derives the optimum distributed precoding angle, and updates the equivalent CSI for the next one, so that each relay node shares much less CSI information with each other, compared with the exhaustive search scheme. Numerical and simulation results demonstrate that in the AF protocol system, the iterative algorithm can help achieve considerable secrecy capacity with a little CSI sharing overhead.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2013•1 citation

Performance analysis of secure AF relay networks using cooperative jamming under outdated CSI

Asma Mabrouk, Kamel Tourki, Mazen O. Hasna +1 more

This paper studies cooperative transmission for securing a two‐hop network where the eavesdropper can wiretap the relay channels. With outdated channel state information (CSI), we propose an opportunistic relaying with destination‐based jamming scheme, where one relay is chosen to forward the confidential signal and the destination sends jamming signal to confuse the eavesdropper. To reveal the capability of the proposed scheme in improving the system secrecy, we investigate the two common performance metrics under different assumptions on the eavesdropper CSI. First, lower bound on the ergodic secrecy capacity (ESC) is derived assuming perfect knowledge of the eavesdropper channel gains. We, then, extend our results to the scenario where only the legitimate channel gain is known. Here, lower bound on the secrecy outage probability (SOP) is obtained. To further improve the utility of the destination, under total power constraint, a power allocation between data signal and jamming noise is considered. Both the analysis and simulation results indicate that the system performance is significantly improved in terms of both ESC and SOP when the jamming power at the destination is adjusted according to the selected relay position. We verify that, with outdated CSI, the secrecy performance of opportunistic relaying is severely degraded.

IET Communications•Jul 24, 2017•10 citations

Secrecy precoding in MIMOME wireless communication system under partial CSI

Runze Dong, Buhong Wang, Kunrui Cao +1 more

In this study, a precoding scheme which is called singular value decomposition and null space (SVDNS) based scheme is proposed to enhance physical layer security of a multiple‐input multiple‐output multiantenna eavesdropper (MIMOME) system. Under the partial channel state information (CSI) of the eavesdropper, the precoding matrix for the information bearing signal is constructed firstly via SVDNS‐based scheme to acquire a compromise between improving performance of the main channel and impairing that of the wiretap channel. Then the optimal power allocation over subchannels formed by precoding matrix is obtained through solving the secrecy rate maximise problem to further improve secrecy performance. After that, under the scenario that CSI of the wiretap channel is less knowable, precoding matrix for artificial noise (AN) is proposed via SVDNS‐based scheme, and then the optimal power allocation between the information bearing signal and AN is obtained while optimal power allocation over subchannels is solved subsequently. Simulation results show that the SVDNS‐based scheme with optimal power allocation achieves a higher secrecy rate than the existing schemes, and the SVDNS‐based scheme with AN aiding could make up for the performance degradation of it without AN in the situation that CSI of the wiretap channel is more unknowable.

IET Communications•May 18, 2020•1 citation

Secrecy-Aware Relay and Antenna Selection for MIMO Wiretap Spectrum-Sharing Network

Priyanka Das, Pradyumna Hegade

To address secrecy performance in a multi-relay underlay wiretap spectrum sharing network, we present a secrecy rate-optimal relay and antenna selection scheme, which serves as a fundamental benchmark. It jointly selects a transmit antenna at a secondary source, a receive antenna at its destination, and a relay between them to maximize the secrecy rate at the destination under the malicious attempt of an eavesdropper. We derive exact and asymptotic expressions for the secrecy outage probability, which accurately reveal the secrecy diversity order and the coding gain. Under a proportional interference constraint, full secrecy diversity order is achieved only when the main link is stronger than the wiretap link, otherwise the diversity gain is lost. We then consider a practical scenario where the secondary users have only the mean channel power gains of the wiretap links. Under such channel state information (CSI), we propose a statistical CSI-based relay and antenna selection scheme and numerically show that this can be used as a better performance/complexity tradeoff. Both the schemes substantially outperform the conventional relay and antenna selection scheme, which requires no CSI about the wiretap links.

IEEE Vehicular Technology Conference•Jun 1, 2022•1 citation

MMSE‐based secure precoding in two‐way relaying systems

Hang Long, Wei Xiang, Luyuan Zhang +1 more

In this study, secure communications in a two‐way relaying wiretap system with a silent eavesdropper are studied. Under the assumption that the channel state information relating to the eavesdropper is unknown at legitimate nodes, the precoding vectors at the two source nodes are jointly designed to decrease the wiretap capacity at the eavesdropper. The derived relationship between the two precoding vectors is partially similar in nature to the linear minimum mean squared error (MMSE) equaliser. An iterative process is proposed to jointly achieve two precoding vectors, and its convergence is proved. Simulation results are presented to demonstrate that the proposed MMSE‐based precoding algorithm can be used for source nodes with any number of antennas, and outperforms its conventional zero‐forcing‐ and matched‐filter‐based counterparts. Signal leakage from the relay node to the eavesdropper is nearly completely suppressed by the proposed precoding design.

IET Communications•Dec 1, 2020•2 citations
Summary Distributed precoding has provento be capable of enhancing the secrecy capacity of the multi‐relay wiretap system. An iterative distributed precoding and channel state information (CSI) sharing scheme can be used to reduce the CSI overhead at each relay node. However, in practical applications, the CSI of each relay node cannot be perfectly known to themselves, especially that of the relay‐eavesdropper channels. Thus, partial CSI for the relay‐eavesdropper links is assumed, and the corresponding distributed precoding and CSI sharing schemes are investigated. Under the assumption that the average value of the relay‐eavesdropper channel is known at each relay node, an extended iterative distributed precoding and CSI sharing scheme is proposed. Simulation results demonstrate that with the increase of the power ratio of the constant part to the random part of the relay‐eavesdropper channels, the proposed scheme with partial CSI performs increasingly close to the one with perfect CSI in secrecy capacity. Copyright © 2014 John Wiley & Sons, Ltd.
The secrecy capacity of relay communications is investigated in this paper, where an eavesdropper is present. Distributed precoding through multiple relay nodes can be used to enhance the received signal power at the destination node and to mitigate the signal leakage to the eavesdropper, simultaneously. Due to individual power constraints at relay nodes, the distributed precoding scalar at each relay node is equivalent to a distributed precoding angle. An iterative algorithm is proposed to find the suboptimum distributed precoding angles at all the relay nodes, where the channel state information (CSI) sharing overhead among the relay nodes can also be substantially reduced. Each relay node receives the equivalent CSI from its preceding relay node, computes its distributed precoding angle, and updates the equivalent CSI for the next relay node. Compared with the simple decode-and-forward relaying protocol with random distributed precoding, the proposed iterative distributed precoding algorithm is able to further improve on the secrecy capacity of the multirelay wiretap system with an acceptable CSI sharing overhead.
The security of the multi-relay wiretap system with an eavesdropper is investigated in this paper, where the amplify-and-forward (AF) relaying protocol is used. Appropriate distributed precoding design at the relay nodes can be utilized to guarantee the secure communication, which means maximizing the ratio of received signal power at the destination node and the eavesdropper node. In decode-and-forward relaying systems, an iterative algorithm has been proposed to find sub-optimum distributed precoding angles at all the relay nodes [1]. In this paper, this algorithm is extended to be used in AF systems with some modifications. In the algorithm, after receiving the equivalent channel state information (CSI) from the last relay node, the current relay node derives the optimum distributed precoding angle, and updates the equivalent CSI for the next one, so that each relay node shares much less CSI information with each other, compared with the exhaustive search scheme. Numerical and simulation results demonstrate that in the AF protocol system, the iterative algorithm can help achieve considerable secrecy capacity with a little CSI sharing overhead.
This paper studies cooperative transmission for securing a two‐hop network where the eavesdropper can wiretap the relay channels. With outdated channel state information (CSI), we propose an opportunistic relaying with destination‐based jamming scheme, where one relay is chosen to forward the confidential signal and the destination sends jamming signal to confuse the eavesdropper. To reveal the capability of the proposed scheme in improving the system secrecy, we investigate the two common performance metrics under different assumptions on the eavesdropper CSI. First, lower bound on the ergodic secrecy capacity (ESC) is derived assuming perfect knowledge of the eavesdropper channel gains. We, then, extend our results to the scenario where only the legitimate channel gain is known. Here, lower bound on the secrecy outage probability (SOP) is obtained. To further improve the utility of the destination, under total power constraint, a power allocation between data signal and jamming noise is considered. Both the analysis and simulation results indicate that the system performance is significantly improved in terms of both ESC and SOP when the jamming power at the destination is adjusted according to the selected relay position. We verify that, with outdated CSI, the secrecy performance of opportunistic relaying is severely degraded.
In this study, a precoding scheme which is called singular value decomposition and null space (SVDNS) based scheme is proposed to enhance physical layer security of a multiple‐input multiple‐output multiantenna eavesdropper (MIMOME) system. Under the partial channel state information (CSI) of the eavesdropper, the precoding matrix for the information bearing signal is constructed firstly via SVDNS‐based scheme to acquire a compromise between improving performance of the main channel and impairing that of the wiretap channel. Then the optimal power allocation over subchannels formed by precoding matrix is obtained through solving the secrecy rate maximise problem to further improve secrecy performance. After that, under the scenario that CSI of the wiretap channel is less knowable, precoding matrix for artificial noise (AN) is proposed via SVDNS‐based scheme, and then the optimal power allocation between the information bearing signal and AN is obtained while optimal power allocation over subchannels is solved subsequently. Simulation results show that the SVDNS‐based scheme with optimal power allocation achieves a higher secrecy rate than the existing schemes, and the SVDNS‐based scheme with AN aiding could make up for the performance degradation of it without AN in the situation that CSI of the wiretap channel is more unknowable.
To address secrecy performance in a multi-relay underlay wiretap spectrum sharing network, we present a secrecy rate-optimal relay and antenna selection scheme, which serves as a fundamental benchmark. It jointly selects a transmit antenna at a secondary source, a receive antenna at its destination, and a relay between them to maximize the secrecy rate at the destination under the malicious attempt of an eavesdropper. We derive exact and asymptotic expressions for the secrecy outage probability, which accurately reveal the secrecy diversity order and the coding gain. Under a proportional interference constraint, full secrecy diversity order is achieved only when the main link is stronger than the wiretap link, otherwise the diversity gain is lost. We then consider a practical scenario where the secondary users have only the mean channel power gains of the wiretap links. Under such channel state information (CSI), we propose a statistical CSI-based relay and antenna selection scheme and numerically show that this can be used as a better performance/complexity tradeoff. Both the schemes substantially outperform the conventional relay and antenna selection scheme, which requires no CSI about the wiretap links.
In this study, secure communications in a two‐way relaying wiretap system with a silent eavesdropper are studied. Under the assumption that the channel state information relating to the eavesdropper is unknown at legitimate nodes, the precoding vectors at the two source nodes are jointly designed to decrease the wiretap capacity at the eavesdropper. The derived relationship between the two precoding vectors is partially similar in nature to the linear minimum mean squared error (MMSE) equaliser. An iterative process is proposed to jointly achieve two precoding vectors, and its convergence is proved. Simulation results are presented to demonstrate that the proposed MMSE‐based precoding algorithm can be used for source nodes with any number of antennas, and outperforms its conventional zero‐forcing‐ and matched‐filter‐based counterparts. Signal leakage from the relay node to the eavesdropper is nearly completely suppressed by the proposed precoding design.