In this paper, we examine the problem of cost/energye cient power allocation in uplink multi-carrier orthogonal frequency-division multiple access (OFDMA) wireless networks. In particular, we consider a set of wireless users who seek to maximize their transmission rate subject to pricing limitations and we show that the resulting non-cooperative game admits a unique equilibrium for almost every realization of the system’s channels. We also propose a distributed exponential learning scheme which allows users to converge to the game’s equilibrium exponentially fast by using only local channel state information (CSI) and signal to interference-plus-noise ratio (SINR) measurements. Given that such measurements are often imperfect in practical scenarios, a major challenge occurs when the users’ information is subject to random perturbations. In this case, by using tools and ideas from stochastic convex programming, we show that the proposed learning scheme retains its convergence properties irrespective of the magnitude of the observational errors.

Adaptive Transmit Policies for Cost-Efficient Power Allocation in Multi-Carrier Systems

PALAZZO, Sergio
2014-01-01

Abstract

In this paper, we examine the problem of cost/energye cient power allocation in uplink multi-carrier orthogonal frequency-division multiple access (OFDMA) wireless networks. In particular, we consider a set of wireless users who seek to maximize their transmission rate subject to pricing limitations and we show that the resulting non-cooperative game admits a unique equilibrium for almost every realization of the system’s channels. We also propose a distributed exponential learning scheme which allows users to converge to the game’s equilibrium exponentially fast by using only local channel state information (CSI) and signal to interference-plus-noise ratio (SINR) measurements. Given that such measurements are often imperfect in practical scenarios, a major challenge occurs when the users’ information is subject to random perturbations. In this case, by using tools and ideas from stochastic convex programming, we show that the proposed learning scheme retains its convergence properties irrespective of the magnitude of the observational errors.
File in 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: https://hdl.handle.net/20.500.11769/98442
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact