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 Conference on Communications

Secure D2D-enabled cellular communication against selective eavesdropping

Weidong Mei, Zhi Chen, Jun Fang, Bin Fu

Published May 1, 2017• 9 citations
Publisher

Abstract

Consider a cellular multiple-input single-output (MISO) channel, in the presence of multiple eavesdroppers (Eves) and one pair of single-antenna device-to-device (D2D) nodes working as an underlay. A novel eavesdropping scenario, termed as selective eavesdropping, is studied in this paper, where Eves arbitrarily select one target from the cellular receiver and the D2D receiver to overhear, but their selection is unknown to any other nodes. Since Eves' two sorts of selection would lead to two different secrecy rates, we define the achievable secrecy rate as the smaller one of the two rates. With imperfect channel state information on all links, our interest lies in the robust design of transmit covariances at the cellular transmitter, such that the worst-case achievable secrecy rate is maximized. This worst-case secrecy rate maximization problem is nonconvex by nature. To deal with it, we develop a convex approximation to seek a computationally efficient lower bound. In particular, the solution can be efficiently computed by successively solving a sequence of convex optimization problems. Then it is proved that the obtained lower bound is attainable by simply utilizing single-stream beamforming. Numerical results are finally presented to demonstrate the efficacy of our proposed methods.

DOI
10.1109/icc.2017.7996937

Related papers

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 artificial noise‐aided transmit optimisation for MISO wiretap channel with device‐to‐device underlay communication

Shuai Huang, Weidong Mei, Shu Fang

This study considers a cellular multiple‐input single‐output system overheard by multiple eavesdroppers, in the presence of multiple pairs of single‐antenna device‐to‐device (D2D) nodes working as an underlay. All D2D nodes are permitted to access the cellular channel for their own communications. A novel eavesdropping scenario, termed as simultaneous eavesdropping, is studied, where the eavesdroppers intend to simultaneously overhear the cellular communication as well as D2D communications. Assuming imperfect channel state information (CSI) at the transmitter, the authors goal is to design the robust transmit covariance of confidential message and artificial noise, such that the worst‐case sum secrecy rate is maximised. This worst‐case sum secrecy rate maximisation problem is challenging to solve due to its non‐convexity and semi‐infiniteness incurred by the imperfect CSI. As a compromise, the authors develop a tractable approximation to its objective secrecy rate function for deriving a computationally efficient lower bound. Then a successive convex approximation (SCA) algorithm is proposed to solve the approximated problem in an iterative manner with provable convergence guarantee. Then it is proved that the SCA algorithm always yields a beam‐forming solution to the confidential message transmission. Numerical results illustrate that the proposed scheme outperforms the traditional one.

IET Communications•Feb 9, 2018•4 citations

Sum secrecy rate optimization for MIMOME wiretap channel with artificial noise and D2D underlay communication

Weidong Mei, Zhi Chen, Jun Fang

This paper considers a cellular multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, with a pair of single-antenna device-to-device (D2D) nodes working as an underlay. A novel eavesdropping scenario is studied in this paper, where the eavesdroppers intend to simultaneously overhear the cellular communication and the D2D communication. Our goal is to jointly optimize the covariance of confidential message and artificial noise, as well as the transmit power at the D2D transmitter, such that the sum secrecy rate is maximized, while satisfying the quality of service constraint on the D2D communication. This sum secrecy rate maximization (SSRM) problem is non-convex by nature. To handle it, an equivalent reformulation of this SSRM problem is introduced, wherein the resulting problem becomes primal decomposable and thus can be iteratively solved using an alternating optimization (AO) algorithm. Also, we prove that the AO algorithm is bound to converge to a stationary point of the primal SSRM problem. Furthermore, we extend the SSRM problem to a more general case with multiple pairs of D2D nodes. Again, the resulting problem is shown to be solvable by the AO algorithm, with provable convergence to the stationary point. Finally, numerical results are presented to verify the efficacy of our proposed method.

International Conference on Communications•May 1, 2017•7 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

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

Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming

Qiang Li, Wing‐Kin Ma

In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.

arXiv:1012.3875•IEEE Transactions on Signal Processing•Apr 26, 2011•246 citations
Consider a cellular multiple-input single-output (MISO) channel, in the presence of multiple eavesdroppers (Eves) and one pair of single-antenna device-to-device (D2D) nodes working as an underlay. A novel eavesdropping scenario, termed as selective eavesdropping, is studied in this paper, where Eves arbitrarily select one target from the cellular receiver and the D2D receiver to overhear, but their selection is unknown to any other nodes. Since Eves' two sorts of selection would lead to two different secrecy rates, we define the achievable secrecy rate as the smaller one of the two rates. With imperfect channel state information on all links, our interest lies in the robust design of transmit covariances at the cellular transmitter, such that the worst-case achievable secrecy rate is maximized. This worst-case secrecy rate maximization problem is nonconvex by nature. To deal with it, we develop a convex approximation to seek a computationally efficient lower bound. In particular, the solution can be efficiently computed by successively solving a sequence of convex optimization problems. Then it is proved that the obtained lower bound is attainable by simply utilizing single-stream beamforming. Numerical results are finally presented to demonstrate the efficacy of our proposed methods.
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.
This study considers a cellular multiple‐input single‐output system overheard by multiple eavesdroppers, in the presence of multiple pairs of single‐antenna device‐to‐device (D2D) nodes working as an underlay. All D2D nodes are permitted to access the cellular channel for their own communications. A novel eavesdropping scenario, termed as simultaneous eavesdropping, is studied, where the eavesdroppers intend to simultaneously overhear the cellular communication as well as D2D communications. Assuming imperfect channel state information (CSI) at the transmitter, the authors goal is to design the robust transmit covariance of confidential message and artificial noise, such that the worst‐case sum secrecy rate is maximised. This worst‐case sum secrecy rate maximisation problem is challenging to solve due to its non‐convexity and semi‐infiniteness incurred by the imperfect CSI. As a compromise, the authors develop a tractable approximation to its objective secrecy rate function for deriving a computationally efficient lower bound. Then a successive convex approximation (SCA) algorithm is proposed to solve the approximated problem in an iterative manner with provable convergence guarantee. Then it is proved that the SCA algorithm always yields a beam‐forming solution to the confidential message transmission. Numerical results illustrate that the proposed scheme outperforms the traditional one.
This paper considers a cellular multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, with a pair of single-antenna device-to-device (D2D) nodes working as an underlay. A novel eavesdropping scenario is studied in this paper, where the eavesdroppers intend to simultaneously overhear the cellular communication and the D2D communication. Our goal is to jointly optimize the covariance of confidential message and artificial noise, as well as the transmit power at the D2D transmitter, such that the sum secrecy rate is maximized, while satisfying the quality of service constraint on the D2D communication. This sum secrecy rate maximization (SSRM) problem is non-convex by nature. To handle it, an equivalent reformulation of this SSRM problem is introduced, wherein the resulting problem becomes primal decomposable and thus can be iteratively solved using an alternating optimization (AO) algorithm. Also, we prove that the AO algorithm is bound to converge to a stationary point of the primal SSRM problem. Furthermore, we extend the SSRM problem to a more general case with multiple pairs of D2D nodes. Again, the resulting problem is shown to be solvable by the AO algorithm, with provable convergence to the stationary point. Finally, numerical results are presented to verify the efficacy of our proposed method.
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.
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.
In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.