Skip to Main content Skip to Navigation
Conference papers

On the Base Station Selection and Base Station Sharing in Self-Configuring Networks

Abstract : We model the interaction of several radio devices aiming to obtain wireless connectivity by using a set of base stations (BS) as a non-cooperative game. Each radio device aims to maximize its own spectral efficiency (SE) in two different scenarios: First, we let each player to use a unique BS (BS selection) and second, we let them to simultaneously use several BSs (BS Sharing). In both cases, we show that the resulting game is an exact potential game. We found that the BS selection game posses multiple Nash equilibria (NE) while the BS sharing game posses a unique one. We provide fully decentralized algorithms which always converge to a NE in both games. We analyze the price of anarchy and the price of stability for the case of BS selection. Finally, we observed that depending on the number of transmitters, the BS selection technique might provide a better global performance (network spectral efficiency) than BS sharing, which suggests the existence of a Braess type paradox.
Complete list of metadatas
Contributor : Elena Veronica Belmega <>
Submitted on : Wednesday, January 13, 2010 - 6:01:59 PM
Last modification on : Wednesday, April 8, 2020 - 3:26:25 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 12:50:19 AM


Files produced by the author(s)


  • HAL Id : hal-00446965, version 1


Samir M. Perlaza, Elena Veronica Belmega, Samson Lasaulce, Merouane Debbah. On the Base Station Selection and Base Station Sharing in Self-Configuring Networks. 3rd ICST/ACM International Workshop on Game Theory in Communication Networks, Oct 2009, Pisa, Italy. pp.1-10. ⟨hal-00446965⟩



Record views


Files downloads