Optimal linear precoding strategies for wideband noncooperative systems based on game theory - Part I: Nash equilibria

被引:168
作者
Scutari, Gesualdo [1 ]
Palomar, Daniel P. [2 ]
Barbarossa, Sergio [1 ]
机构
[1] Univ Roma La Sapienza, Dept INFOCOM, I-00184 Rome, Italy
[2] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China
基金
美国国家科学基金会;
关键词
ad hoc networks; cognitive radio; game theory; linear precoding; mutual information; Nash equilibrium;
D O I
10.1109/TSP.2007.907807
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-multipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and bandwidth. We assume, as optimality criterion, the achievement of a Nash equilibrium and consider two alternative optimization problems: 1) the competitive maximization of mutual information on each link, given constraints on the transmit power and on the spectral mask imposed by the radio spectrum regulatory bodies; and 2) the competitive maximization of the transmission rate, using finite order constellations, under the same constraints as above, plus a constraint on the average error probability. In this first part of the paper, we start by showing that the solution set of both noncooperative games is always nonempty and contains only pure strategies. Then, we prove that the optimal precoding/multiplexing scheme for both games leads to a channel diagonalizing structure, so that both matrix-valued problems can be recast in a simpler unified vector power control game, with no performance penalty. Thus, we study this simpler game and derive sufficient conditions ensuring the uniqueness of the Nash equilibrium. Interestingly, although derived under stronger constraints, incorporating for example spectral mask constraints, our uniqueness conditions have broader validity than previously known conditions. Finally, we assess the goodness of the proposed decentralized strategy by comparing its performance with the performance of a Pareto-optimal centralized scheme. To reach the Nash equilibria of the game, in Part II, we propose alternative distributed algorithms, along with their convergence conditions.
引用
收藏
页码:1230 / 1249
页数:20
相关论文
共 51 条
  • [1] A survey on wireless mesh networks
    Akyildiz, IF
    Wang, XD
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2005, 43 (09) : S23 - S30
  • [2] Equilibrium, games, and pricing in transportation and telecommunication networks
    Altman, E
    Wynter, L
    [J]. NETWORKS & SPATIAL ECONOMICS, 2004, 4 (01) : 7 - 21
  • [3] [Anonymous], MULTIOBJECTIVE OPTIM
  • [4] AUBIN JP, 1980, MATH METHOD GAME EC
  • [5] Berman A., 1987, NONNEGATIVE MATRICES
  • [6] Boyd S., 2003, CONVEX OPTIMIZATION
  • [7] Campbell S.L., 1991, Generalized Inverses of Linear Transformations
  • [8] Optimal multiuser spectrum balancing for digital subscriber lines
    Cendrillon, Raphael
    Yu, Wei
    Moonen, Marc
    Verlinden, Jan
    Bostoen, Tom
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (05) : 922 - 933
  • [9] CHENG RS, 1993, IEEE T INFORM THEORY, V39, P773, DOI 10.1109/18.256487
  • [10] Chung ST, 2003, 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, P316