Joint RIS-aided Precoding and Multislot Scheduling for Maximum User Admission in Smart CitiesShow others and affiliations
2024 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, Vol. 72, no 1, p. 418-433Article in journal (Refereed) Published
Abstract [en]
Reconfigurable intelligent surfaces (RISs) have emerged as a game-changing technology to improve wireless network performance by intelligently manipulating and customizing the physical propagation environment. Such capability is especially important for the application of smart cities as it increases wireless service offers and quality to end-users. In this paper, we aim to maximize the number of served users in a challenging RIS-Aided smart city street by jointly optimizing the multislot scheduling, precoding, and passive RIS-based beamforming design under quality of service and power constraints. Multislot scheduling is introduced in order to benefit from additional time diversity and thus better exploit the available degrees of freedom. The formulated problem is a mixed integer nonlinear programming, which is NP-hard. To solve the problem with affordable complexity, we develop an efficient iterative algorithm based on binary variable relaxation, alternating optimization, and successive convex approximation techniques. Simulation results demonstrate the superiority of the proposed design over the design without RIS and the design without scheduling, especially in the presence of a large number of users. In addition, results illustrate that by introducing a quality of service margin, the proposed design can improve its robustness to outdated channel state information in mobility scenarios.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2024. Vol. 72, no 1, p. 418-433
National Category
Signal Processing
Research subject
Electrical Engineering; Telecommunication
Identifiers
URN: urn:nbn:se:kth:diva-364752DOI: 10.1109/TCOMM.2023.3321731ISI: 001166809900043Scopus ID: 2-s2.0-85174834557OAI: oai:DiVA.org:kth-364752DiVA, id: diva2:1970019
Note
QC 20250617
2025-06-162025-06-162025-09-30Bibliographically approved