Abstract
We propose an artificial noise (AN)-aided max-min fairness (MMF) secure precoding algorithm. The algorithm jointly optimizes precoders and AN covariance matrix without alternation for a multiuser multiple-input multiple-output system with multiple colluding eavesdroppers. The formulated AN-aided MMF problem involves several challenges such as non-convexity, non-smoothness, coupled optimization variables, and partial wiretap channel state information at a transmitter (CSIT). To address the challenges, we first consider the perfect wiretap CSIT and approximate the reformulated problem as a smooth problem. Then, we derive the first-order optimality condition and interpret it as a nonlinear eigenvalue problem. Finally, we adopt a power iteration method to solve the condition. To extend the algorithm to the partial wiretap CSIT scenario, we reformulate the problem with an average wiretap rate by deriving an approximate lower bound of the rate. This enables us to exploit the partial channel knowledge. Subsequently, we propose the algorithm for the partial wiretap CSIT. Simulations validate the proposed methods.
Funding Information
  • National Research Foundation of Korea (2021R1C1C1004438)
  • Ministry of Science and ICT, South Korea
  • Information Technology Research Center (IITP-2023-RS-2023-00259991)
  • Institute for Information and Communications Technology Planning and Evaluation

This publication has 21 references indexed in Scilit: