TY - JOUR
T1 - Robust Design for IRS-Aided Communication Systems with User Location Uncertainty
AU - Hu, Xiaoling
AU - Zhong, Caijun
AU - Alouini, Mohamed-Slim
AU - Zhang, Zhaoyang
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2020
Y1 - 2020
N2 - In this paper, we propose a robust design framework for IRS-aided communication systems in the presence of user location uncertainty. By jointly designing the transmit beamforming vector at the BS and phase shifts at the IRS, we aim to minimize the transmit power subject to the worse-case quality of service (QoS) constraint, i.e., ensuring the user rate is above a threshold for all possible user location error realizations. With unit-modulus, this problem is not convex. The location uncertainty in the QoS constraint further increases the difficulty of solving this problem. By utilizing techniques of Taylor expansion, S-Procedure and semidefinite relaxation (SDP), we transform this problem into a sequence of semidefinite programming (SDP) sub-problems. Simulation results show that the proposed robust algorithm substantially outperforms the non-robust algorithm proposed in the literature, in terms of probability of reaching the required QoS target.
AB - In this paper, we propose a robust design framework for IRS-aided communication systems in the presence of user location uncertainty. By jointly designing the transmit beamforming vector at the BS and phase shifts at the IRS, we aim to minimize the transmit power subject to the worse-case quality of service (QoS) constraint, i.e., ensuring the user rate is above a threshold for all possible user location error realizations. With unit-modulus, this problem is not convex. The location uncertainty in the QoS constraint further increases the difficulty of solving this problem. By utilizing techniques of Taylor expansion, S-Procedure and semidefinite relaxation (SDP), we transform this problem into a sequence of semidefinite programming (SDP) sub-problems. Simulation results show that the proposed robust algorithm substantially outperforms the non-robust algorithm proposed in the literature, in terms of probability of reaching the required QoS target.
UR - http://hdl.handle.net/10754/665118
UR - https://ieeexplore.ieee.org/document/9184012/
U2 - 10.1109/LWC.2020.3020850
DO - 10.1109/LWC.2020.3020850
M3 - Article
SN - 2162-2345
SP - 1
EP - 1
JO - IEEE Wireless Communications Letters
JF - IEEE Wireless Communications Letters
ER -