Robust Secure Beamforming for Multiuser MISO Wiretap Channels

2020 
Physical layer security has recently emerged as a promising approach to provide secure wireless communications. Physical layer security technology is the key means to achieve security and communication integration. The built-in security mechanism based on the characteristics of wireless channel provides a feasible idea for the realization of “one secret at a time”. It has important application prospects in integrity protection of service data, Internet of things (IoT) lightweight encryption and blockchain wireless security technology. In this paper, we consider the scenario of a unicast multiuser multiple-input single-output (MISO) downlink system in the presence of multiple single-antenna passive eavesdroppers. Instead of assuming perfect channel state information (CSI), we investigate the artificial noise (AN)-aided robust transmit beamforming scheme with imperfect CSI on legitimate receivers and no CSI regarding eavesdroppers at the transmitter. Under the fixed total transmit power, the information symbol and the AN are transmitted concurrently. We aim to guarantee each legitimate receiver's signal-to-interference-and-noise ratio(SINR) outage probability below a preset level with minimum power. Hence, as much power as possible can be allocated to AN to confuse the eavesdroppers. In order to reduce the negative impact on the legitimate receivers, the AN is transmitted in the null space of the estimated legitimate channels. To deal with this nonconvex optimization problem, a rank relaxed formulation is obtained by employing semidefinite relaxation (SDR). Then we propose two approaches by using Bernstein-type inequality and S-procedure, respectively, to transform the probabilistic constraints into deterministic constraints. The optimization problem is reformulated as a convex semidefinite program (SDP). Simulation results show that the proposed approaches have better performances than the non-robust approach.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    27
    References
    0
    Citations
    NaN
    KQI
    []