Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.