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 Antennas and Propagation

Secrecy Balancing over Two-User MISO Interference Channels with Rician Fading

Jiqing Ni, Zesong Fei, Chengwen Xing, Di Zhao, Niwei Wang, Jingming Kuang

Published Jan 1, 2013• 4 citations
Publisher

Abstract

This paper considers a 2-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), in which the Rician channel model is assumed. The coordinated beamforming vectors at the two transmitters have the similar parameterizations as those for perfect CSI, which could be optimized jointly and achieved by agreeing on the real parameters between the two users. Our main contribution is that a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results present the secrecy performance over the 2-user MISO IFC-CM scenario.

DOI
10.1155/2013/546260

Related papers

Secrecy-Rate Balancing for Two-User MISO Interference Channels

Jiqing Ni, Kai‐Kit Wong, Zesong Fei +4 more

This paper considers a two-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), where the beamforming vectors at the two transmitters are jointly optimized using the closed-form Pareto-optimal parameterization. We show that coordinated beamforming is secrecy-rate optimal which is achieved by agreeing on the parameters between the two transmitters. We first analyze the feasible set of the beamforming parameters that guarantees positiveness of the secrecy rates. We then derive a quadratic relationship that finds the Pareto-optimal parameters to achieve secrecy-rate balancing beamforming.

IEEE Wireless Communications Letters•Feb 1, 2014•19 citations

Robust Coordinated Beamforming for Secure MISO Interference Channels with Bounded Ellipsoidal Uncertainties

Jiqing Ni, Zesong Fei, Kai‐Kit Wong +3 more

This letter addresses the robust optimization problem of downlink coordinated beamforming over the multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM) exploiting imperfect channel state information (CSI) at the transmitters. Our aim is to minimize the total transmitted power subject to the worst-case individual signal-to-interference-plus-noise-ratio (SINR) and equivocation rates. To model the imperfect CSI, bounded ellipsoidal uncertainties for channel vector and covariance are both considered. By deriving the equivalent forms for the SINR and secrecy constraints, the worst-case robust problem can be reformulated as a semi-definite programming (SDP) with the help of rank relaxation. Simulation results show the effectiveness of the proposed algorithm.

IEEE Wireless Communications Letters•Aug 1, 2013•15 citations

On Linear Precoding for the Two-User MISO Broadcast Channel With Confidential Messages and Per-Antenna Constraints

Ayman Mostafa, Lutz Lampe

We study the design of linear precoders for secure transmission in the two-user multiple-input single-output (MISO) broadcast channel with confidential messages (BC-CM). The transmitter has multiple antennas, and each user has a single receive antenna. Two independent messages are simultaneously transmitted, one intended for each user, and each message should be kept confidential from the other user. Assuming real-valued transmitted signals, we design the linear precoders subject to total and per-antenna average power constraints, and also subject to amplitude constraints. In both cases, we tackle the design problem via weighted secrecy sum rate maximization. The resulting problem, however, involves a fractional objective, making it nonconvex and difficult to solve. Nevertheless, we show that this difficult problem can be transformed into a more tractable problem, for which a solution can be obtained by an iterative search algorithm. In addition, we characterize a condition under which the obtained solution is guaranteed to be optimal. Furthermore, we show that the problem formulation and solution approach can be easily extended to handle the robust version of the design problem with uncertain channel information. We provide numerical examples to demonstrate the performance of the proposed precoder in terms of the achievable secrecy rate regions subject to the aforementioned constraints. We also demonstrate the performance of the robust precoder under different channel uncertainty levels.

IEEE Transactions on Signal Processing•Aug 28, 2017•6 citations

Secure Communication through Nakagami-m Fading MISO Channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.

International Conference on Communications•Jun 1, 2011•10 citations

Robust Beamforming Design: From Cognitive Radio MISO Channels to Secrecy MISO Channels

Lan Zhang, Ying‐Chang Liang, Yiyang Pei +1 more

This paper studies the robust beamforming design problem for a multiple-input single-output (MISO) secrecy channel with a single-antenna eavesdropper. Due to the illegal nature, the eavesdropper may try to hide itself from being caught; thus, it could be difficult for the secrecy transmitter (S-Tx) to obtain accurate channel state information (CSI) of the eavesdropping link between S-Tx and the eavesdropper. Assuming that the CSI of the eavesdropping link belongs to a known uncertain set, this paper designs the optimal transmit strategy for the secrecy user to maximize the transmit rate under the condition that the eavesdropper cannot decode the secrecy message for all possible channel realizations of the eavesdropping link. This robust design problem is non-convex and cannot be solved by existing algorithms in the literature. By exploiting the relationship between the secrecy MISO channel and the cognitive radio (CR) MISO channel, this problem is transformed into a robust CR beamforming design problem, which can be solved efficiently by the interior point method. Numerical examples are provided to illustrate the effectiveness of the proposed algorithm.

Globecom•Nov 1, 2009•34 citations

Secrecy Rate Optimizations for a MISO Secrecy Channel with Multiple Multiantenna Eavesdroppers

Zheng Chu, Hong Xing, Martin Johnston +1 more

This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.

IEEE Transactions on Wireless Communications•Aug 24, 2015•115 citations
This paper considers a 2-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), in which the Rician channel model is assumed. The coordinated beamforming vectors at the two transmitters have the similar parameterizations as those for perfect CSI, which could be optimized jointly and achieved by agreeing on the real parameters between the two users. Our main contribution is that a quadratic relationship between the two real-valued parameters can be derived for the Rician channel to reach the ergodic secrecy rate balancing point. Simulation results present the secrecy performance over the 2-user MISO IFC-CM scenario.
This paper considers a two-user multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM), where the beamforming vectors at the two transmitters are jointly optimized using the closed-form Pareto-optimal parameterization. We show that coordinated beamforming is secrecy-rate optimal which is achieved by agreeing on the parameters between the two transmitters. We first analyze the feasible set of the beamforming parameters that guarantees positiveness of the secrecy rates. We then derive a quadratic relationship that finds the Pareto-optimal parameters to achieve secrecy-rate balancing beamforming.
This letter addresses the robust optimization problem of downlink coordinated beamforming over the multiple-input single-output (MISO) interference channel with confidential messages (IFC-CM) exploiting imperfect channel state information (CSI) at the transmitters. Our aim is to minimize the total transmitted power subject to the worst-case individual signal-to-interference-plus-noise-ratio (SINR) and equivocation rates. To model the imperfect CSI, bounded ellipsoidal uncertainties for channel vector and covariance are both considered. By deriving the equivalent forms for the SINR and secrecy constraints, the worst-case robust problem can be reformulated as a semi-definite programming (SDP) with the help of rank relaxation. Simulation results show the effectiveness of the proposed algorithm.
We study the design of linear precoders for secure transmission in the two-user multiple-input single-output (MISO) broadcast channel with confidential messages (BC-CM). The transmitter has multiple antennas, and each user has a single receive antenna. Two independent messages are simultaneously transmitted, one intended for each user, and each message should be kept confidential from the other user. Assuming real-valued transmitted signals, we design the linear precoders subject to total and per-antenna average power constraints, and also subject to amplitude constraints. In both cases, we tackle the design problem via weighted secrecy sum rate maximization. The resulting problem, however, involves a fractional objective, making it nonconvex and difficult to solve. Nevertheless, we show that this difficult problem can be transformed into a more tractable problem, for which a solution can be obtained by an iterative search algorithm. In addition, we characterize a condition under which the obtained solution is guaranteed to be optimal. Furthermore, we show that the problem formulation and solution approach can be easily extended to handle the robust version of the design problem with uncertain channel information. We provide numerical examples to demonstrate the performance of the proposed precoder in terms of the achievable secrecy rate regions subject to the aforementioned constraints. We also demonstrate the performance of the robust precoder under different channel uncertainty levels.
We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.
This paper studies the robust beamforming design problem for a multiple-input single-output (MISO) secrecy channel with a single-antenna eavesdropper. Due to the illegal nature, the eavesdropper may try to hide itself from being caught; thus, it could be difficult for the secrecy transmitter (S-Tx) to obtain accurate channel state information (CSI) of the eavesdropping link between S-Tx and the eavesdropper. Assuming that the CSI of the eavesdropping link belongs to a known uncertain set, this paper designs the optimal transmit strategy for the secrecy user to maximize the transmit rate under the condition that the eavesdropper cannot decode the secrecy message for all possible channel realizations of the eavesdropping link. This robust design problem is non-convex and cannot be solved by existing algorithms in the literature. By exploiting the relationship between the secrecy MISO channel and the cognitive radio (CR) MISO channel, this problem is transformed into a robust CR beamforming design problem, which can be solved efficiently by the interior point method. Numerical examples are provided to illustrate the effectiveness of the proposed algorithm.
This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.