10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Optimal Power Allocation for Secrecy Rate Maximization in Broadcast Wiretap Channels

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references 14

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

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

           ,   (2011)
          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.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Artificial Noise: Transmission Optimization in Multi-Input Single-Output Wiretap Channels

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential Messages

              In this paper, we study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achievable secrecy sum-rate which is almost surely exact as the number of transmit antennas \(M\) and the number of users \(K\) grow to infinity in a fixed ratio \(\beta=K/M\). We derive the optimal regularization parameter \(\xi\) and the optimal network load \(\beta\) that maximize the per-antenna secrecy sum-rate. We then propose a linear precoder based on RCI and power reduction (RCI-PR) that significantly increases the high-SNR secrecy sum-rate for \(1<\beta<2\). Our proposed precoder achieves a per-user secrecy rate which has the same high-SNR scaling factor as both the following upper bounds: (i) the rate of the optimum RCI precoder without secrecy requirements, and (ii) the secrecy capacity of a single-user system without interference. Furthermore, we obtain a deterministic approximation for the secrecy sum-rate achievable by RCI precoding in the presence of channel state information (CSI) error. We also analyze the performance of our proposed RCI-PR precoder with CSI error, and we determine how the error must scale with the SNR in order to maintain a given rate gap to the case with perfect CSI.
                Bookmark

                Author and article information

                Journal
                IEEE Wireless Communications Letters
                IEEE Wireless Commun. Lett.
                Institute of Electrical and Electronics Engineers (IEEE)
                2162-2337
                2162-2345
                August 2018
                August 2018
                : 7
                : 4
                : 514-517
                Article
                10.1109/LWC.2018.2792006
                © 2018
                Product

                Comments

                Comment on this article