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

arXiv:1503.07455 · IEEE Globecom Workshops (GC Wkshps)

Sum Secrecy Rate in MISO Full-Duplex Wiretap Channel with Imperfect CSI

Sanjay Vishwakarma, A. Chockalingam

Published Dec 1, 2015• 9 citations
arXivHTMLPDF

Abstract

In this paper, we consider the achievable sum secrecy rate in MISO (multiple-input-single-output) full-duplex wiretap channel in the presence of a passive eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication have multiple transmit antennas, and that the users and the eavesdropper have single receive antenna each. The users have individual transmit power constraints. They also transmit jamming signals to improve the secrecy rates. We obtain the achievable perfect secrecy rate region by maximizing the worst case sum secrecy rate. We also obtain the corresponding transmit covariance matrices associated with the message signals and the jamming signals. Numerical results that show the impact of imperfect CSI on the achievable secrecy rate region are presented.

DOI
10.1109/glocomw.2015.7414075

Related papers

Sum Secrecy Rate in Full-Duplex Wiretap Channel with Imperfect CSI

Sanjay Vishwakarma, A. Chockalingam

In this paper, we consider the achievable sum secrecy rate in full-duplex wiretap channel in the presence of an eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication and the eavesdropper have single antenna each. The users have individual transmit power constraints. They also transmit jamming signals to improve the secrecy rates. We obtain the achievable perfect secrecy rate region by maximizing the sum secrecy rate. We also obtain the corresponding optimum powers of the message signals and the jamming signals. Numerical results that show the impact of imperfect CSI on the achievable secrecy rate region are presented.

arXiv:1311.3918•Nov 15, 2013•3 citations

The achievable secrecy rate of MISO wiretap channels

Zhang Haiyang, Baoyun Wang

In this paper, we study the achievable secrecy rate of the multiple input single output (MISO) wiretap channel, which consists of a transmitter, a legitimate receiver and multiple eavesdroppers. The transmitter is equipped with multiple antennas, while the receiver and all the eavesdroppers each have a single antenna. We assume that the transmitter has perfect channel state information (CSI) for their links to legitimate receiver, but it has only imperfect CSI for their channels to eavesdroppers. Optimal transmit covariance matrix is obtained based on worst-case secrecy rate maximization, under power constraints. The maximum secrecy rate computation can be formulated as a non-convex optimal problem, which cannot be solved directly. In this paper, we transform non-convex optimal problem into a quasi-convex optimal problem which can be efficiently solved with the bisection method. The simulation result and analysis demonstrate the effectiveness of our methods.

International Conference on Wireless Communications and Signal Processing (WCSP)•Nov 1, 2011•3 citations

Beyond Secrecy Rate in MISO Wiretap Channels: An Information Jamming Approach

Haiyang Zhang, Lingjie Duan

Cooperative jamming is a widely used approach for improving the security of wireless networks. In this approach, a friendly jammer sends jamming signals to disrupt the reception of the eavesdropper, which inevitably interferes with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to exceed the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that multiple multi-antenna information jammers (iJammers) transmit the source signals of the legitimate transmitter rather than independent noise signals for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. Specifically, we aim at maximizing the achievable secrecy rate by jointly optimizing the beamforming vectors at Alice and iJammers, subject to the individual transmit power constraints. We first propose a semi-definite relaxation based approach to solve the original non-convex problem optimally. For ease of implementation, we then provide a suboptimal distributed information beamforming scheme, whose optimal solution is obtained in closed-form. Finally, we extend our study to the imperfect channel state information case. Simulation results show that our proposed information jamming approach significantly outperforms the traditional cooperative jamming approach in terms of achievable secrecy rate.

IEEE Transactions on Communications•Feb 11, 2020•4 citations

Robust secure transmission for Gaussian MISO wiretap channels with imperfect CSI

Tang Yanqun, Dongtang Ma, Wang Degang +1 more

We study robust secure transmit design in terms of input covariance matrix for Gaussian multiple-input single-output (MISO) wiretap channels in the presence of a single-antenna eavesdropper. Under the assumption that the transmitter knows partial channel state information (CSI) on the main and eavesdropper's channels, we jointly design the input covariance matrices of information-bearing signal and artificial noise (AN) to maximize the secrecy rate. Unfortunately, the secrecy rate maximization (SRM) problem is difficult to solve. We derive a safe approximation to the SRM problem and propose a tractable approach to solve it. To get more insights, we discuss the rank property of the input covariance matrix of the information-bearing signal. Finally, the simulation results are provided to verify the validity and robustness of our proposed transmit design.

National Doctoral Academic Forum on Information and Communications Technology•Jan 1, 2013•0 citations

Robust Sum Secrecy Rate Optimization for MIMO Two-Way Full Duplex Systems

Zheng Chu, Tuan Anh Le, Huan Xuan Nguyen +2 more

This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm- bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.

arXiv:1705.06113•IEEE Vehicular Technology Conference•Sep 1, 2017•5 citations

Robust beamforming for MISO wiretap channel by optimizing the worst-case secrecy capacity

Wei Shi, James A. Ritcey

A Gaussian multiple-input single-output (MISO) secrecy channel is considered, where a transmitter is equipped with multiple antennas, and an intended receiver and an eavesdropper each equipped with a single antenna. This paper studies the robust beamforming design in the presence of uncertainty of channel state information (CSI) on the eavesdropper channel. Under the assumption that all possible states of the eavesdropper channel are in a given set, the problem of optimizing the transmit covariance for the worst-case secrecy capacity which is the maximum transmission rate at which the eavesdropper is unable to decode under any channel realization in the set, is cast as a max-min optimization problem. We propose to transfer the max-min problem into a convex optimization problem that can be solved efficiently. The optimal secrecy rate and transmit covariance are expressed in the form of the generalized eigenvalue and eigenvector, the same form as the conventional case of the perfect eavesdropper's CSI, which indicates our results is the generalization of the conventional case.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2010•32 citations
In this paper, we consider the achievable sum secrecy rate in MISO (multiple-input-single-output) full-duplex wiretap channel in the presence of a passive eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication have multiple transmit antennas, and that the users and the eavesdropper have single receive antenna each. The users have individual transmit power constraints. They also transmit jamming signals to improve the secrecy rates. We obtain the achievable perfect secrecy rate region by maximizing the worst case sum secrecy rate. We also obtain the corresponding transmit covariance matrices associated with the message signals and the jamming signals. Numerical results that show the impact of imperfect CSI on the achievable secrecy rate region are presented.
In this paper, we consider the achievable sum secrecy rate in full-duplex wiretap channel in the presence of an eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication and the eavesdropper have single antenna each. The users have individual transmit power constraints. They also transmit jamming signals to improve the secrecy rates. We obtain the achievable perfect secrecy rate region by maximizing the sum secrecy rate. We also obtain the corresponding optimum powers of the message signals and the jamming signals. Numerical results that show the impact of imperfect CSI on the achievable secrecy rate region are presented.
In this paper, we study the achievable secrecy rate of the multiple input single output (MISO) wiretap channel, which consists of a transmitter, a legitimate receiver and multiple eavesdroppers. The transmitter is equipped with multiple antennas, while the receiver and all the eavesdroppers each have a single antenna. We assume that the transmitter has perfect channel state information (CSI) for their links to legitimate receiver, but it has only imperfect CSI for their channels to eavesdroppers. Optimal transmit covariance matrix is obtained based on worst-case secrecy rate maximization, under power constraints. The maximum secrecy rate computation can be formulated as a non-convex optimal problem, which cannot be solved directly. In this paper, we transform non-convex optimal problem into a quasi-convex optimal problem which can be efficiently solved with the bisection method. The simulation result and analysis demonstrate the effectiveness of our methods.
Cooperative jamming is a widely used approach for improving the security of wireless networks. In this approach, a friendly jammer sends jamming signals to disrupt the reception of the eavesdropper, which inevitably interferes with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to exceed the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that multiple multi-antenna information jammers (iJammers) transmit the source signals of the legitimate transmitter rather than independent noise signals for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. Specifically, we aim at maximizing the achievable secrecy rate by jointly optimizing the beamforming vectors at Alice and iJammers, subject to the individual transmit power constraints. We first propose a semi-definite relaxation based approach to solve the original non-convex problem optimally. For ease of implementation, we then provide a suboptimal distributed information beamforming scheme, whose optimal solution is obtained in closed-form. Finally, we extend our study to the imperfect channel state information case. Simulation results show that our proposed information jamming approach significantly outperforms the traditional cooperative jamming approach in terms of achievable secrecy rate.
We study robust secure transmit design in terms of input covariance matrix for Gaussian multiple-input single-output (MISO) wiretap channels in the presence of a single-antenna eavesdropper. Under the assumption that the transmitter knows partial channel state information (CSI) on the main and eavesdropper's channels, we jointly design the input covariance matrices of information-bearing signal and artificial noise (AN) to maximize the secrecy rate. Unfortunately, the secrecy rate maximization (SRM) problem is difficult to solve. We derive a safe approximation to the SRM problem and propose a tractable approach to solve it. To get more insights, we discuss the rank property of the input covariance matrix of the information-bearing signal. Finally, the simulation results are provided to verify the validity and robustness of our proposed transmit design.
This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm- bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.
A Gaussian multiple-input single-output (MISO) secrecy channel is considered, where a transmitter is equipped with multiple antennas, and an intended receiver and an eavesdropper each equipped with a single antenna. This paper studies the robust beamforming design in the presence of uncertainty of channel state information (CSI) on the eavesdropper channel. Under the assumption that all possible states of the eavesdropper channel are in a given set, the problem of optimizing the transmit covariance for the worst-case secrecy capacity which is the maximum transmission rate at which the eavesdropper is unable to decode under any channel realization in the set, is cast as a max-min optimization problem. We propose to transfer the max-min problem into a convex optimization problem that can be solved efficiently. The optimal secrecy rate and transmit covariance are expressed in the form of the generalized eigenvalue and eigenvector, the same form as the conventional case of the perfect eavesdropper's CSI, which indicates our results is the generalization of the conventional case.