Robust secure resource optimization for active STAR-RIS systems

In this paper, we investigate the robust secure resource optimization for the active simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) system under the imperfect eavesdroppers channel state information. Considering the fairness, a max–min secure rate optimization problem is formulated based on several practical constraints. To deal with the original non-convex problem, an alternative iteration algorithm is proposed. First, the original problem is decomposed into two non-convex sub-problems. Next, the continuous convex approximation and S-procedure techniques are applied to deal with the non-convex and uncertainty constraints, respectively. Then, the first-order Taylor expansion formula is utilized to approximate the convex difference form of the objective function. Finally, two sub-problems are transformed into convex ones and alternately solved until convergence. Simulation results show that the secure rate of the proposed scheme is higher than the conventional schemes.