Optimal Dynamic Point Selection for Power Minimization in Multiuser Downlink CoMP
pith:V74ZSJQL Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{V74ZSJQL}
Prints a linked pith:V74ZSJQL badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
This paper examines a CoMP system where multiple base-stations (BS) employ coordinated beamforming to serve multiple mobile-stations (MS). Under the dynamic point selection mode, each MS can be assigned to only one BS at any time. This work then presents a solution framework to optimize the BS associations and coordinated beamformers for all MSs. With target signal-to-interference-plus-noise ratios at the MSs, the design objective is to minimize either the weighted sum transmit power or the per-BS transmit power margin. Since the original optimization problems contain binary variables indicating the BS associations, finding their optimal solutions is a challenging task. To circumvent this difficulty, we first relax the original problems into new optimization problems by expanding their constraint sets. Based on the nonconvex quadratic constrained quadratic programming framework, we show that these relaxed problems can be solved optimally. Interestingly, with the first design objective, the obtained solution from the relaxed problem is also optimal to the original problem. With the second design objective, a suboptimal solution to the original problem is then proposed, based on the obtained solution from the relaxed problem. Simulation results show that the resulting jointly optimal BS association and beamforming design significantly outperforms fixed BS association schemes.
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.