Skip to Main content Skip to Navigation
Journal articles

The Waterfilling Game-Theoretical Framework for Distributed Wireless Network Information Flow

Abstract : We present a general game-theoretical framework for the resource allocation problem in the down- link scenario 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 frequency division multiplexing (OFDM) channels. In such a game-theoretic study, the 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. We show that this resource allocation problem can be studied as a potential game, and hence efficiently solved. We discuss the convergence of waterfilling based best-response algorithm. Finally, numerical results are provided to investigate the inefficiency of NE.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Samir Medina Perlaza Connect in order to contact the contributor
Submitted on : Saturday, January 15, 2011 - 2:50:40 PM
Last modification on : Monday, December 14, 2020 - 12:38:05 PM
Long-term archiving on: : Saturday, April 16, 2011 - 2:52:08 AM


Files produced by the author(s)




Gaoning He, Laura Cottatellucci, Merouane Debbah. The Waterfilling Game-Theoretical Framework for Distributed Wireless Network Information Flow. EURASIP Journal on Wireless Communications and Networking, SpringerOpen, 2010, Volume 2010 (2010), Article ID 482975, 13 p. ⟨10.1155/2010/482975⟩. ⟨hal-00556137⟩



Les métriques sont temporairement indisponibles