Abstract
This paper considers a distributed power allocation scheme for sum-rate-maximization under cognitive Gaussian multiple access channels (GMACs), where primary users and secondary users may communicate under mutual interference with the Gaussian noise. Formulating the problem as a standard nonconvex quadratically constrained quadratic problem (QCQP) provides a simple distributed method to find a solution using iterative Jacobian method instead of using centralized schemes. A totally asynchronous distributed power allocation for sum-rate maximization on cognitive GMACs is suggested. Simulation results show that this distributed algorithm for power allocation converges to a fixed point and the solution achieves almost the same performance as the exhaustive search.
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.
