MIMO Cognitive Radio: A Game Theoretical Approach
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...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing Jg. 58; H. 2; S. 761 - 780 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.02.2010
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 1053-587X, 1941-0476 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1053-587X 1941-0476 |
| DOI: | 10.1109/TSP.2009.2032039 |