Interference Avoidance Methods for Wireless Systems (Information Technology Transmission, Processing and Storage)
A potential game approach to distributed power control and scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Codeword quantization for interference avoidance
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Wireless systems and interference avoidance
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Optimal sequences and sum capacity of synchronous CDMA systems
IEEE Transactions on Information Theory
Iterative construction of optimum signature sequence sets in synchronous CDMA systems
IEEE Transactions on Information Theory
CDMA codeword optimization: interference avoidance and convergence via class warfare
IEEE Transactions on Information Theory
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum
IEEE Transactions on Information Theory
On the stability of distributed sequence adaptation for cellular asynchronous DS-CDMA systems
IEEE Transactions on Information Theory
Sum capacity and TSC bounds in collaborative multibase wireless systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Signature sequence adaptation for DS-CDMA with multipath
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Interference avoidance in networks with distributed receivers
IEEE Transactions on Communications
SINR-maximizing spreading code allocation for non-linear serial interference cancellation
IEEE Transactions on Communications
A survey on game theory applications in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.