A Game-Theoretic Framework for Interference Avoidance

被引:31
作者
Menon, R. [1 ]
MacKenzie, A. B. [2 ]
Hicks, J. [3 ]
Buehrer, R. M. [2 ]
Reed, J. H. [2 ]
机构
[1] Tyco Elect, Lynchburg, VA 24501 USA
[2] Virginia Tech, Wireless Virginia Tech, Blacksburg, VA 24061 USA
[3] Aerosp Corp, Chantilly, VA 20151 USA
关键词
Game theory; interference avoidance; iterative construction of signature sequences; reduced feedback schemes; POWER-CONTROL; SEQUENCE ADAPTATION; SUM CAPACITY; CDMA SYSTEMS; DS-CDMA; CONVERGENCE; STABILITY;
D O I
10.1109/TCOMM.2009.04.070192
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Various iterative algorithms for interference avoidance (IA) in networks with co-located receivers, suitable for distributed implementation, have been proposed in the literature. In this paper, the IA problem is cast in a game-theoretic framework and is formulated as a potential game. This formulation accommodates previously proposed algorithms and, in addition, gives us a framework that enables the design of new distributed and convergent algorithms for IA including algorithms with nonidentical utility functions for the users. Two new convergence results for potential games are then derived. The first result establishes the convergence of a class of potential games to the global solution while following best response iterations and when noise is added. The second result establishes the convergence of potential games to the Nash equilibria of the game while following random better response iterations. The first result combined with the potential game formulation allows us to show that. for a large class of network scenarios, arbitrarily small noise assures the convergence of best response IA algorithms, including the eigen-iterations, to an arbitrarily small neighborhood of the globally optimal signature sequence set. The second result enables the design of reduced feedback mechanisms for IA that converge to desirable solutions.
引用
收藏
页码:1087 / 1098
页数:12
相关论文
共 33 条
  • [1] Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum
    Anigstein, P
    Anantharam, V
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) : 873 - 885
  • [2] [Anonymous], 1969, Nonlinear programming: a unified approach
  • [3] [Anonymous], 1996, 1 COURSE OPTIMIZATIO, DOI DOI 10.1017/CBO9780511804526
  • [4] Bazaraa MS., 2013, Nonlinear programming: theory and algorithms
  • [5] Bernstein D. S., 2005, MATRIX MATH THEORY F
  • [6] Optimization of CDMA signature sequences in multipath channels
    Concha, JI
    Ulukus, S
    [J]. IEEE VTC 53RD VEHICULAR TECHNOLOGY CONFERENCE, SPRING 2001, VOLS 1-4, PROCEEDINGS, 2001, : 1978 - 1982
  • [7] Dutta KP, 1999, STRATEGIES GAMES THE
  • [8] A potential game approach to distributed power control and scheduling
    Heikkinen, T.
    [J]. COMPUTER NETWORKS, 2006, 50 (13) : 2295 - 2311
  • [9] HICKS J, 2004, P IEEE GLOB TEL C NO, V1, P251
  • [10] Distributed interference compensation for wireless networks
    Huang, JW
    Berry, RA
    Honig, ML
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (05) : 1074 - 1084