Cross-Layer Optimization: Joint User Scheduling and Beamforming Design With QoS Support in Joint Transmission Networks

User scheduling and beamforming design are two crucial yet coupled topics for multiuser wireless communication systems. They are usually addressed separately with conventional optimization methods. In this paper, cross-layer optimization problem is considered, namely, the user scheduling and beamfor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2023-02, Vol.71 (2), p.792-807
Hauptverfasser: He, Shiwen, An, Zhenyu, Zhu, Jianyue, Zhang, Min, Huang, Yongming, Zhang, Yaoxue
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:User scheduling and beamforming design are two crucial yet coupled topics for multiuser wireless communication systems. They are usually addressed separately with conventional optimization methods. In this paper, cross-layer optimization problem is considered, namely, the user scheduling and beamforming are jointly discussed, subjecting to the requirement of per-user quality of service and the maximum allowable transmit power for multicell multiuser joint transmission networks. To achieve the goal, a mixed discrete-continuous variables combinational optimization problem is investigated with aiming at maximizing the sum rate of the communication system. To circumvent the original non-convex problem with dynamic solution space, we first transform it into a 0-1 integer and continuous variables optimization problem, and then obtain a tractable form with continuous variables by exploiting the characteristics of the 0-1 integer constraints. Finally, the scheduled users and the optimized beamforming vectors are simultaneously calculated by an alternating optimization algorithm. We also theoretically prove that the base stations allocate zero power to the unscheduled users. Furthermore, two heuristic optimization algorithms are proposed respectively based on brute-force search and greedy search. Numerical results validate the effectiveness of our proposed methods, and the optimization approach gets relatively balanced results compared with the other two approaches.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2022.3226487