Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Secure Transmission Design for Virtual Antenna Array-aided Device-to-device Multicast Communications

Xinyue Hu, Yibo Yi, Kun Li, Hongwei Zhang, Caihong Kai

TL;DR

Simulation results validate the improvements of the VAA-aided D2DM scheme in terms of communication security compared with conventional D2 DM schemes.

Abstract

This paper investigates the physical-layer security in a Virtual Antenna Array (VAA)-aided Device- to-Device Multicast (D2DM) communication system, where the User Equipments (UEs) who cache the common content will form a VAA system and cooperatively multicast the content to UEs who desire it. Specifically, with the target of securing the VAA-aided D2DM communication under the threat of multiple eavesdroppers, we propose a secure beamforming scheme by jointly considering the formed VAA and the Base Station (BS). For obtaining the optimal beamforing vectors, a nonsmooth and nonconvex Weight Sum Rate Maximization Problem (WRMP) is formulated and solved using Successive Convex Approximation (SCA) approach. Furthermore, we consider the worst case that eavesdroppers cooperatively form a eavesdrop VAA to enhance the overhearing capacity. In this case, we modify the securing beamforming scheme, formulate the corresponding WRMP and solve it using a two-level optimization. Simulation results validate the improvements of the VAA-aided D2DM scheme in terms of communication security compared with conventional D2DM schemes.

Secure Transmission Design for Virtual Antenna Array-aided Device-to-device Multicast Communications

TL;DR

Simulation results validate the improvements of the VAA-aided D2DM scheme in terms of communication security compared with conventional D2 DM schemes.

Abstract

This paper investigates the physical-layer security in a Virtual Antenna Array (VAA)-aided Device- to-Device Multicast (D2DM) communication system, where the User Equipments (UEs) who cache the common content will form a VAA system and cooperatively multicast the content to UEs who desire it. Specifically, with the target of securing the VAA-aided D2DM communication under the threat of multiple eavesdroppers, we propose a secure beamforming scheme by jointly considering the formed VAA and the Base Station (BS). For obtaining the optimal beamforing vectors, a nonsmooth and nonconvex Weight Sum Rate Maximization Problem (WRMP) is formulated and solved using Successive Convex Approximation (SCA) approach. Furthermore, we consider the worst case that eavesdroppers cooperatively form a eavesdrop VAA to enhance the overhearing capacity. In this case, we modify the securing beamforming scheme, formulate the corresponding WRMP and solve it using a two-level optimization. Simulation results validate the improvements of the VAA-aided D2DM scheme in terms of communication security compared with conventional D2DM schemes.
Paper Structure (21 sections, 2 theorems, 79 equations, 8 figures, 2 algorithms)

This paper contains 21 sections, 2 theorems, 79 equations, 8 figures, 2 algorithms.

Table of Contents

  1. Introduction
  2. System Model and Preliminary
  3. A Tractable Approach to Tackle the RRM Problem (WRMP)
  4. Weighted Rate Maximization Problem
  5. Solving (13)
  6. Convex approximation of C6
  7. Convex approximation of C7
  8. Convex approximation of C4 and C5
  9. Extension to the Worst Case
  10. A Semidefinite Relaxation Based Approach for handling ${\rm{C}}7'$
  11. The Inner-Level Optimization
  12. Convex approximation of ${\rm{C}}4"$
  13. Convex approximation of ${\rm{C}}6"$
  14. The Outer-Level Optimization
  15. Rank-Profile Analysis
  16. ...and 6 more sections

Key Result

Lemma 1

For any ${\bf{G}}_E^{} \in _{}^{M \times L}$, ${\bf{G}}_B^{} \in _{}^{K \times L}$, ${\bf{W}}_B^{} \succeq {\bf{0}}$, ${\bf{W}}^{} \succeq {\bf{0}}$ and ${\bf{Q}} \succeq {\bf{0}}$. Furthermore, the equivalence in (47) holds if ${\mathop{\rm Rank}\nolimits} \left( {\bf{W}} \right) \le 1$.

Figures (8)

  • Figure 1: System scenario of the considered VD2DM, in which exists $M$ D2D transmitters, $N$ D2D receivers and $L$ eavesdroppers.
  • Figure 2: The achievable rate of D2DM versus $P_{\rm{max}}$ with respect to different number of D2D transmitters, in which $K=15, N=5, L=0$ and $P_{B}=40$ dB.
  • Figure 3: The achievable secrecy rate of D2DM versus $P_{\rm{max}}$ with respect to different number of D2D transmitters, in which $K=15, N=5, L=5$ and $P_{B}=40$ dB.
  • Figure 4: The achievable secrecy rate of D2DM versus $P_{\rm{max}}$, in which $K=15, M=5, N=5, L=5$ and $P_{B}=40$ dB.
  • Figure 5: The achievable rate of CUE with respect to $P_{\rm{max}}$, where $K=15, M=5, N=5, L=5$ and $P_{B}=40$ dB.
  • ...and 3 more figures

Theorems & Definitions (5)

  • Remark 1
  • Lemma 1
  • Remark 2
  • Remark 3
  • Proposition 1