pith. sign in

arxiv: 2210.16667 · v1 · pith:GPGAMCC3new · submitted 2022-10-29 · 📡 eess.SP · cs.SY· eess.SY

IRS-User Association in IRS-Aided MISO Wireless Networks: Convex Optimization and Machine Learning Approaches

classification 📡 eess.SP cs.SYeess.SY
keywords problemoptimizationalgorithmco-basedconvexassociationcomplexityirs-user
0
0 comments X
read the original abstract

This paper concentrates on the problem of associating an intelligent reflecting surface (IRS) to multiple users in a multiple-input single-output (MISO) downlink wireless communication network. The main objective of the paper is to maximize the sum-rate of all users by solving the joint optimization problem of the IRS-user association, IRS reflection, and BS beamforming, formulated as a non-convex mixed-integer optimization problem. The variable separation and relaxation are used to transform the problem into three convex sub-problems, which are alternatively solved through the convex optimization (CO) method. The major drawback of the proposed CO-based algorithm is high computational complexity. Thus, we make use of machine learning (ML) to tackle this problem. To this end, first, we convert the optimization problem into a regression problem. Then, we solve it with feed-forward neural networks (FNNs), trained by CO-based generated data. Simulation results show that the proposed ML-based algorithm has a performance equivalent to the CO-based algorithm, but with less computation complexity due to its offline training procedure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.