Abstract
This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite $b$ -matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
