Elements of information theory
Elements of information theory
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Convex Optimization
Fundamentals of wireless communication
Fundamentals of wireless communication
A potential game approach to distributed power control and scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Geometric programming for communication systems
Communications and Information Theory
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
EURASIP Journal on Applied Signal Processing
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
IEEE Transactions on Signal Processing
MIMO cognitive radio: a game theoretical approach
IEEE Transactions on Signal Processing
EURASIP Journal on Wireless Communications and Networking - Special issue on femtocell networks
Capacity of fading channels with channel side information
IEEE Transactions on Information Theory
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
IEEE Transactions on Information Theory
Dynamic spectrum management for next-generation DSL systems
IEEE Communications Magazine
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present a general game-theoretical framework for power allocation in the downlink of distributed wireless small-cell networks, where multiple access points (APs) or small base stations send independent coded network information to multiple mobile terminals (MTs) through orthogonal channels. In such a game-theoretical study, a central question is whether a Nash equilibrium (NE) exists, and if so, whether the network operates efficiently at the NE. For independent continuous fading channels, we prove that the probability of a unique NE existing in the game is equal to 1. Furthermore, we show that this power allocation problem can be studied as a potential game, and hence efficiently solved. In order to reach the NE, we propose a distributed waterfilling-based algorithm requiring very limited feedback. The convergence behavior of the proposed algorithm is discussed. Finally, numerical results are provided to investigate the price of anarchy or inefficiency of the NE.