Abstract

This paper studies the power control problem for spectrum sharing based cognitive radio (CR) networks with multiple secondary source-to-destination (SD) pairs. A simple distributed algorithm is proposed for the secondary users (SUs) to iteratively adjust their transmit powers to improve the performance of the network. The proposed algorithm does not require each SU (or PU) to negotiate with other SUs (or PUs) during the communication. It is proved that the proposed algorithm can obtain a time average performance as good as that achieved when the Nash equilibrium (NE) is chosen in hindsight. More specifically, the average performance of CR networks will converge to an ε-Nash equilibrium at a rate of T <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε</sub> = O (exp (1/ε)). A sub-optimal algorithm is also introduced to further improve the convergence rate to T <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε'</sub> /log T <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε'</sub> = O (1/ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ε'</sub> ). Numerical results are presented to show the performance of the proposed algorithms under different settings.

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.