Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
From MaRDI portal
Publication:3604761
Abstract: This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the solution set to our problem. Then, to compute the solutions of the game, we propose two distributed algorithms based on the single user waterfilling solution: The emph{sequential} and the emph{simultaneous} iterative waterfilling algorithms, wherein the users update their own strategies sequentially and simultaneously, respectively. We derive a unified set of sufficient conditions that guarantee the uniqueness of the solution and global convergence of both algorithms. Our results are applicable to all practical distributed multipoint-to-multipoint interference systems, either wired or wireless, where a quality of service in terms of information rate must be guaranteed for each link.
Recommendations
- Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
- Shannon rate-efficient power allocation games
- Price-based interference avoidance game in the Gaussian interference channel
- CDMA uplink power control as a noncooperative game
- Power control under finite power constraints
Cited in
(46)- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- On convergence rates of game theoretic reinforcement learning algorithms
- A decomposition method for a class of convex generalized Nash equilibrium problems
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- A fully distributed learning algorithm for power allocation in heterogeneous networks
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- A coercivity condition for nonmonotone quasiequilibria on finite-dimensional spaces
- A barrier function method for generalized Nash equilibrium problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Shannon rate-efficient power allocation games
- Evolutionary variational inequality formulation of the generalized Nash equilibrium problem
- Shares allocation methods for generalized game problems with joint constraints
- Optimum power allocation for parallel Gaussian channels with arbitrary input distributions
- Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
- An improved two-step method for solving generalized Nash equilibrium problems
- Price-based interference avoidance game in the Gaussian interference channel
- Space–Time Power Schedule for Distributed MIMO Links Without Instantaneous Channel State Information at the Transmitting Nodes
- Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation
- Distributed Asynchronous Optimization Framework for the MISO Interference Channel
- Robust power modulation for channel state information exchange
- Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation
- Decomposable penalty method for generalized game problems with joint constraints
- An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique
- Application of the decomposable penalty method to a class of generalized Nash equilibrium problems
- Exact penalization of generalized Nash equilibrium problems
- Partial penalization for the solution of generalized Nash equilibrium problems
- A nonconvergent example for the iterative water-filling algorithm
- Generalized Nash equilibrium problems
- Three modeling paradigms in mathematical programming
- Algorithm design and approximation analysis on distributed robust game
- Rational Generalized Nash Equilibrium Problems
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Distributed Nash equilibrium seeking for networked games of multiple high-order systems with disturbance rejection and communication delay
- A globally convergent improved BFGS method for generalized Nash equilibrium problems
- Inexact Newton method for solving generalized Nash equilibrium problems
- Distributed Nash equilibrium seeking for multi-cluster aggregative games with applications to location control
- Distributed generalized Nash equilibrium seeking approach via surrogate functions for noncooperative nonconvex games
- Restricted generalized Nash equilibria and controlled penalty algorithm
- Algebraic degrees of generalized Nash equilibrium problems
- Generalized Bayesian Nash equilibrium with continuous type and action spaces
- Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
- Neural network for solving Nash equilibrium problem in application of multiuser power control
- Distributed robust adaptive equilibrium computation for generalized convex games
- Bargaining and the MISO interference channel
This page was built for publication: Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604761)
