Matrix analysis
Elements of information theory
Elements of information theory
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
EURASIP Journal on Applied Signal Processing
The MIMO iterative waterfilling algorithm
IEEE Transactions on Signal Processing
IEEE 802.22: the first cognitive radio wireless regional area network standard
IEEE Communications Magazine
Spectrum management for interference-limited multiuser communication systems
IEEE Transactions on Information Theory
Practical algorithms for a family of waterfilling solutions
IEEE Transactions on Signal Processing
Autonomous Spectrum Balancing for Digital Subscriber Lines
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Optimized signaling for MIMO interference systems with feedback
IEEE Transactions on Signal Processing
A survey of spectrum sensing algorithms for cognitive radio applications
IEEE Communications Surveys & Tutorials
IEEE Transactions on Wireless Communications
Optimal Power Schedule for Distributed MIMO Links
IEEE Transactions on Wireless Communications
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
IEEE Transactions on Information Theory
Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
IEEE Transactions on Information Theory
Limits on communications in a cognitive radio channel
IEEE Communications Magazine
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
Competition Versus Cooperation on the MISO Interference Channel
IEEE Journal on Selected Areas in Communications
Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View
IEEE Journal on Selected Areas in Communications
Competitive optimization of cognitive radio MIMO systems via game theory
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
The waterfilling game-theoretical framework for distributed wireless network information flow
EURASIP Journal on Wireless Communications and Networking - Special issue on dynamic spectrum access: from the concept to the implementation
Competitive unlicensed spectrum sharing with partial information on slow fading channels
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Cognitive Radio MIMO Gaussian Broadcast Channels with the Power Constraint
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 35.68 |
The concept of cognitive radio (CR) has recently received great attention from the research community as a promising paradigm to achieve efficient use of the frequency resource by allowing the coexistence of licensed (primary) and unlicensed (secondary) users in the same bandwidth. In this paper we propose and analyze a totally decentralized approach, based on game theory, to design cognitive MIMO transceivers, who compete with each other to maximize their information rate. The formulation incorporates constraints on the transmit power as well as null and/or soft shaping constraints on the transmit covariance matrix, so that the interference generated by secondary users be confined within the temperature-interference limit required by the primary users. We provide a unified set of conditions that guarantee the uniqueness and global asymptotic stability of the Nash equilibrium of all the proposed games through totally distributed and asynchronous algorithms. Interestingly, the proposed algorithms overcome the main drawback of classical waterfilling based algorithms--the violation of the temperature-interference limit--and they have the desired features required for CR applications, such as low-complexity, distributed implementation, robustness against missing or outdated updates of the users, and fast convergence behavior.