In this paper we propose a unified framework, based on a new distributed algorithm to compute the Nash equilibrium point of the power allocation game in a frequency-selective multiuser interference channel. The proposed scheme is based on a totally asynchronous updating of the power allocation from the users, where some users may change their power allocation more frequently than others and, furthermore, they are allowed to use also outdated version of the interference. The proposed algorithm contains as special cases the well-known iterative water-filling algorithm, either sequential or simultaneous. Our main contribution is then to provide a unified set of sufficient conditions under which all these algorithms are guaranteed to convergence to the unique Nash equilibrium of the game. These conditions enlarge those existing in the literature for the convergence of the sequential iterative water-filling algorithm.

Asynchronous Iterative Water-filling for Gaussian Frequency-Selective Interference Channels: A Unified Framework / SCUTARI, GESUALDO; D. P., PALOMAR; BARBAROSSA, Sergio. - (2006). ((Intervento presentato al convegno 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC tenutosi a Cannes; France nel July 2-5, 2006 [10.1109/SPAWC.2006.346415].

Asynchronous Iterative Water-filling for Gaussian Frequency-Selective Interference Channels: A Unified Framework

SCUTARI, GESUALDO;BARBAROSSA, Sergio
2006

Abstract

In this paper we propose a unified framework, based on a new distributed algorithm to compute the Nash equilibrium point of the power allocation game in a frequency-selective multiuser interference channel. The proposed scheme is based on a totally asynchronous updating of the power allocation from the users, where some users may change their power allocation more frequently than others and, furthermore, they are allowed to use also outdated version of the interference. The proposed algorithm contains as special cases the well-known iterative water-filling algorithm, either sequential or simultaneous. Our main contribution is then to provide a unified set of sufficient conditions under which all these algorithms are guaranteed to convergence to the unique Nash equilibrium of the game. These conditions enlarge those existing in the literature for the convergence of the sequential iterative water-filling algorithm.
078039710X
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/365785
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? ND
social impact