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

Journal of Physics Conference Series

Robust Secrecy Rate Optimizations for Healthy Monitoring System MISO Channel with D2D Communications

Xuemeng Jia, Mingjun Pei, Rong Fu, Zhanwei Jiao

Published Apr 1, 2020• 1 citation
Publisher

Abstract

Abstract In this paper, we study the robust secrecy rate optimization of multiple-input-single-output (MISO) security channels with multiple device-to-device (D2D) communication in an electronic physical system for health monitoring applications. We focus on the problems of robust power minimization and maximizing robust secrecy with transmit power in this system. Both of these robust optimizations are subject to probability-based secrecy and D2D transmission rates. The design of robust beamforming can consider combining statistical channel uncertainty model (CUM), but the problem of construction is a non-convexity problem that is not easy to solve, so we propose two methods to solve this problem: based on Bernstein-type inequality and a conservative approximation of S-Procedure. The simulation results demonstrate that the performance of the S-Procedure method on the reachable confidentiality rate is not as good as the method based on the Bernstein-type inequality.

DOI
10.1088/1742-6596/1518/1/012079

Related papers

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

Robust secrecy rate optimisations for multiuser multiple‐input‐single‐output channel with device‐to‐device communications

Zheng Chu, Kanapathippillai Cumanan, Mai Xu +1 more

In the present study, the authors investigate robust secrecy rate optimisation problems for a multiple‐input‐single‐output secrecy channel with multiple device‐to‐device (D2D) communications. The D2D communication nodes access this secrecy channel by sharing the same spectrum, and help to improve the secrecy communications by confusing the eavesdroppers. In return, the legitimate transmitter ensures that the D2D communication nodes achieve their required rates. In addition, it is assumed that the legitimate transmitter has imperfect channel state information of different nodes. For this secrecy network, the authors solve two robust secrecy rate optimisation problems: (a) robust power minimisation problem, subject to the probability based secrecy rate and the D2D transmission rate constraints; (b) robust secrecy rate maximisation problem with the transmit power, the probabilistic based secrecy rate and the D2D transmission rate constraints. Owing to the non‐convexity of robust beamforming design based on two statistical channel uncertainty models, the authors present two conservative approximation approaches based on ‘Bernstein‐type’ inequality and ‘S‐Procedure’ to solve these robust optimisation problems. Simulation results are provided to validate the performance of these two conservative approximation methods, where it is shown that ‘Bernstein‐type’ inequality based approach outperforms the ‘S‐Procedure’ approach in terms of achievable secrecy rates.

IET Communications•Oct 22, 2014•46 citations

Robust Sum Secrecy Rate Optimization for MISO Systems with Device-to-Device Communication

Weidong Mei, Zhi Chen, Jun Fang

This paper considers a cellular multiple-input single- output (MISO) system overheard by multiple eavesdroppers, in the presence of one pair of device- to-device (D2D) nodes working as an underlay to the cellular network. A novel eavesdropping scenario is studied in this paper, where the eavesdroppers intend to simultaneously overhear the cellular communication as well as the D2D communication. Assuming imperfect channel state information (CSI) at the transmitter, our goal is to design the input covariance matrix of confidential message such that the worst-case sum secrecy rate is maximized, while satisfying the quality of service (QoS) requirement in the D2D communication. Although this worst-case sum secrecy rate maximization (SSRM) problem is non-convex, we show that it can be handled by solving a sequence of semidefinite programming (SDP) problems. Moreover, we give complexity analysis of our proposed optimization method and prove that transmit beamforming is an optimal strategy for the confidential message transmission. Numerical results are presented to verify the efficacy of our proposed method.

IEEE Vehicular Technology Conference•Jun 1, 2017•0 citations

Robust Beamforming Design for Secure Multiuser MISO Interference Channel

Hongbo Xu, Bingru Zhu, Jun Liu +1 more

In this letter, we investigate the secure beamforming design for multiuser multiple-input single-output interference channel with an eavesdropper. The robust secrecy rate optimization problem is studied with the imperfect channel state information. We consider the beamforming design to maximize the minimum worst case secrecy rate subject to the transmit power constraints with norm-bounded channel uncertainty. The problem is non-convex and hard to solve. We propose an effective method to reformulate this non-convex problem as a series of tractable convex program problems with linear matrix inequality and second-order cone constraints by exploiting the conservative approximation and the sequential convex approximation methods. The simulation results demonstrate the effectiveness of the proposed algorithm.

IEEE Communications Letters•Jan 2, 2017•11 citations

Probabilistic Robust Secure Beamforming in MISO Channels With Imperfect LCSI and Statistical ECSI

Jing Xu, Siwen Xu, Chongbin Xu

In this paper, we investigate the robust secure transmit beamformming design for multiple-input single-output wiretap channels overheard by multiple non-collaborating single-antenna eavesdroppers. Assuming that at the transmitter, the instantaneous legitimate receiver's channel state information (CSI) is imperfect and only the statistical eavesdroppers' CSI is known, we seek to maximize the target secrecy rate R with the total transmit power constraint and the secrecy outage probability constraint. The resulting outage-constrained secrecy rate maximization (O-SRM) is non-convex and difficult to solve. Thus, we develop an efficient algorithm to solve it and determine the robust secure beamforming design. Specifically speaking, we first prove that the original O-SRM problem can be solved by an equivalent outage-constrained power minimization problem (O-PMP), which is easy to perform semi-definite relaxation (SDR) and can be solved by semi-definite program (SDP) consequently. Second, we transform the non-convex secrecy rate outage constraints into deterministic ones by resorting to Bernstein-type inequality II. Finally, by solving the convex approximation of the O-PMP with different Rs and bisection search over R, we convert the original O-SRM problem into a sequence of solvable SDPs. Simulation results are provided to verify the secrecy-rate performance improvement of the proposed robust beamforming compared with the existing worst-case design proposed by Li and Ma and the simple non-robust maximum-ratio transmission.

IEEE Access•Jan 1, 2017•10 citations

Optimal and Robust Secure Beamformer for Indoor MISO Visible Light Communication

Shuai Ma, Zhi‐Long Dong, Hang Li +2 more

In this paper, the physical-layer secrecy problem is investigated for the indoor multiple-input single-output (MISO) visible light communication systems. First, when the channel state information (CSI) of eavesdroppers is perfect, two kinds of optimal secure beamformers are, respectively, designed to minimize the transmit power and to maximize the secrecy rate. Moreover, it is shown that the secrecy rate maximization problem can be decomposed into a sequence of convex feasibility problems, which can be efficiently solved by using interior point methods. Second, when the CSI of eavesdroppers is imperfect, an ellipsoidal region model is applied to characterize the CSI uncertainty. This model leads to an infinite number of complicated constraints for the design of robust secure beamformers. By using the$\mathcal {S}$-lemma and semidefinite relaxation, this nonconvex problem is transformed into the convex semidefinite program. Finally, numerical results demonstrate the optimality and robustness of the proposed methods.

Journal of Lightwave Technology•Aug 31, 2016•61 citations
Abstract In this paper, we study the robust secrecy rate optimization of multiple-input-single-output (MISO) security channels with multiple device-to-device (D2D) communication in an electronic physical system for health monitoring applications. We focus on the problems of robust power minimization and maximizing robust secrecy with transmit power in this system. Both of these robust optimizations are subject to probability-based secrecy and D2D transmission rates. The design of robust beamforming can consider combining statistical channel uncertainty model (CUM), but the problem of construction is a non-convexity problem that is not easy to solve, so we propose two methods to solve this problem: based on Bernstein-type inequality and a conservative approximation of S-Procedure. The simulation results demonstrate that the performance of the S-Procedure method on the reachable confidentiality rate is not as good as the method based on the Bernstein-type inequality.
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.
In the present study, the authors investigate robust secrecy rate optimisation problems for a multiple‐input‐single‐output secrecy channel with multiple device‐to‐device (D2D) communications. The D2D communication nodes access this secrecy channel by sharing the same spectrum, and help to improve the secrecy communications by confusing the eavesdroppers. In return, the legitimate transmitter ensures that the D2D communication nodes achieve their required rates. In addition, it is assumed that the legitimate transmitter has imperfect channel state information of different nodes. For this secrecy network, the authors solve two robust secrecy rate optimisation problems: (a) robust power minimisation problem, subject to the probability based secrecy rate and the D2D transmission rate constraints; (b) robust secrecy rate maximisation problem with the transmit power, the probabilistic based secrecy rate and the D2D transmission rate constraints. Owing to the non‐convexity of robust beamforming design based on two statistical channel uncertainty models, the authors present two conservative approximation approaches based on ‘Bernstein‐type’ inequality and ‘S‐Procedure’ to solve these robust optimisation problems. Simulation results are provided to validate the performance of these two conservative approximation methods, where it is shown that ‘Bernstein‐type’ inequality based approach outperforms the ‘S‐Procedure’ approach in terms of achievable secrecy rates.
This paper considers a cellular multiple-input single- output (MISO) system overheard by multiple eavesdroppers, in the presence of one pair of device- to-device (D2D) nodes working as an underlay to the cellular network. A novel eavesdropping scenario is studied in this paper, where the eavesdroppers intend to simultaneously overhear the cellular communication as well as the D2D communication. Assuming imperfect channel state information (CSI) at the transmitter, our goal is to design the input covariance matrix of confidential message such that the worst-case sum secrecy rate is maximized, while satisfying the quality of service (QoS) requirement in the D2D communication. Although this worst-case sum secrecy rate maximization (SSRM) problem is non-convex, we show that it can be handled by solving a sequence of semidefinite programming (SDP) problems. Moreover, we give complexity analysis of our proposed optimization method and prove that transmit beamforming is an optimal strategy for the confidential message transmission. Numerical results are presented to verify the efficacy of our proposed method.
In this letter, we investigate the secure beamforming design for multiuser multiple-input single-output interference channel with an eavesdropper. The robust secrecy rate optimization problem is studied with the imperfect channel state information. We consider the beamforming design to maximize the minimum worst case secrecy rate subject to the transmit power constraints with norm-bounded channel uncertainty. The problem is non-convex and hard to solve. We propose an effective method to reformulate this non-convex problem as a series of tractable convex program problems with linear matrix inequality and second-order cone constraints by exploiting the conservative approximation and the sequential convex approximation methods. The simulation results demonstrate the effectiveness of the proposed algorithm.
In this paper, we investigate the robust secure transmit beamformming design for multiple-input single-output wiretap channels overheard by multiple non-collaborating single-antenna eavesdroppers. Assuming that at the transmitter, the instantaneous legitimate receiver's channel state information (CSI) is imperfect and only the statistical eavesdroppers' CSI is known, we seek to maximize the target secrecy rate R with the total transmit power constraint and the secrecy outage probability constraint. The resulting outage-constrained secrecy rate maximization (O-SRM) is non-convex and difficult to solve. Thus, we develop an efficient algorithm to solve it and determine the robust secure beamforming design. Specifically speaking, we first prove that the original O-SRM problem can be solved by an equivalent outage-constrained power minimization problem (O-PMP), which is easy to perform semi-definite relaxation (SDR) and can be solved by semi-definite program (SDP) consequently. Second, we transform the non-convex secrecy rate outage constraints into deterministic ones by resorting to Bernstein-type inequality II. Finally, by solving the convex approximation of the O-PMP with different Rs and bisection search over R, we convert the original O-SRM problem into a sequence of solvable SDPs. Simulation results are provided to verify the secrecy-rate performance improvement of the proposed robust beamforming compared with the existing worst-case design proposed by Li and Ma and the simple non-robust maximum-ratio transmission.
In this paper, the physical-layer secrecy problem is investigated for the indoor multiple-input single-output (MISO) visible light communication systems. First, when the channel state information (CSI) of eavesdroppers is perfect, two kinds of optimal secure beamformers are, respectively, designed to minimize the transmit power and to maximize the secrecy rate. Moreover, it is shown that the secrecy rate maximization problem can be decomposed into a sequence of convex feasibility problems, which can be efficiently solved by using interior point methods. Second, when the CSI of eavesdroppers is imperfect, an ellipsoidal region model is applied to characterize the CSI uncertainty. This model leads to an infinite number of complicated constraints for the design of robust secure beamformers. By using theS\mathcal {S}S-lemma and semidefinite relaxation, this nonconvex problem is transformed into the convex semidefinite program. Finally, numerical results demonstrate the optimality and robustness of the proposed methods.