ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Energy efficiency-delay tradeoffs in CDMA networks: a game-theoretic approach
IEEE Transactions on Information Theory
Distributed power control using non-monotonic reaction curves
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Nash equilibrium design and optimization
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Retransmission aware congestion control and distributed power allocation in MANETs
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Noncooperative carrier sense game in wireless networks
IEEE Transactions on Wireless Communications
Uplink multi-cell non-cooperative power allocation game alogrithm for OFDMA cellular networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A power control game with smooth reduction of SINR objectives
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A game-theoretic approach to joint rate and power control for uplink CDMA communications
IEEE Transactions on Communications
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Economic Approaches for Cognitive Radio Networks: A Survey
Wireless Personal Communications: An International Journal
A Power Control Based Admission Algorithm for Maximizing Throughput in a CDMA Network
Wireless Personal Communications: An International Journal
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.07 |
We present a game-theoretic treatment of distributed power control in CDMA wireless systems using outage probabilities. We first prove that the noncooperative power control game considered admits a unique Nash equilibrium (NE) for uniformly strictly convex pricing functions and under some technical assumptions on the SIR threshold levels. We then analyze global convergence of continuous-time as well as discrete-time synchronous and asynchronous iterative power update algorithms to the unique NE of the game. Furthermore, we show that a stochastic version of the discrete-time update scheme, which models the uncertainty due to quantization and estimation errors, converges almost surely to the unique NE point. We finally investigate and demonstrate the convergence and robustness properties of these update schemes through simulation studies.