More about Base Station Location Games

Abstract : This paper addresses the problem of locating base stations in a certain area which is highly populated by mobile stations; each mobile station is assumed to select the closest base station. Base stations are modeled by players who choose their best location for maximizing their uplink throughput. The approach of this paper is to make some simplifying assumptions in order to get interpretable analytical results and insights to the problem under study. Specifically, a relatively complete Nash equilibrium (NE) analysis is conducted (existence, uniqueness, determination, and efficiency). Then, assuming that the base station location can be adjusted dynamically, the best-response dynamics and reinforcement learning algorithm are applied, discussed, and illustrated through numerical results.
Type de document :
Communication dans un congrès
The 5th International Conference on Performance Evaluation Methodologies and Tools (Valuetools), May 2011, France. pp.1-9, 2011
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00592366
Contributeur : François Mériaux <>
Soumis le : jeudi 12 mai 2011 - 11:01:37
Dernière modification le : lundi 17 septembre 2018 - 10:04:09

Lien texte intégral

Identifiants

  • HAL Id : hal-00592366, version 1
  • ARXIV : 1105.2243

Citation

François Mériaux, Samson Lasaulce, Michel Kieffer. More about Base Station Location Games. The 5th International Conference on Performance Evaluation Methodologies and Tools (Valuetools), May 2011, France. pp.1-9, 2011. 〈hal-00592366〉

Partager

Métriques

Consultations de la notice

308