Intelligent Reflecting Surface Aided Wireless Networks: Dynamic User Access and System Sum-Rate MaximizationShow others and affiliations
2022 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 70, no 4, p. 2870-2881Article in journal (Refereed) Published
Abstract [en]
In this paper, we conceive the design of dynamic wireless networks assisted by multiple intelligent reflecting surfaces (IRSs), where the connection states between users and IRSs are capable of being updated timely. Taking into account the time-varying states of the system, we further construct a long-term dynamic process. Our goal is to maximize the time average sum-rate of the dynamic system under the time average rate and power constraints of users, via jointly optimizing the power allocation at users and the reflecting coefficients at IRSs. With the aid of Lyapunov concept-based drift-plus-penalty (DPP) algorithm, the long-term optimization problem is formulated as an infinite-horizon time-average one. Subsequently, the fractional programming method based on Lagrangian dual transform is applied to optimize power allocation and reflecting coefficients in an iterative manner, and the closed-form solutions of power and reflecting coefficients can be obtained at each iteration. Finally, simulation results demonstrate the convergence and effectiveness of the proposed algorithm. Further performance comparisons indicate that the proposed algorithm can maintain a balance between supply and demand for resource allocation and improve the fairness of users.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2022. Vol. 70, no 4, p. 2870-2881
Keywords [en]
Optimization, Heuristic algorithms, Resource management, Uplink, Wireless networks, Dynamical systems, Dynamic scheduling, Intelligent reflecting surface (IRS), access selection, power allocation, reflecting coefficient, Lyapunov optimization, fractional programming
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-311680DOI: 10.1109/TCOMM.2022.3155147ISI: 000782801000050Scopus ID: 2-s2.0-85125708190OAI: oai:DiVA.org:kth-311680DiVA, id: diva2:1655270
Note
QC 20220502
2022-05-022022-05-022022-06-25Bibliographically approved