Satisfying demands in heterogeneous networks

Abstract : In this paper, we consider a heterogeneous network (eg. Macrocells overlaid with small cells), where users associated with their respective base stations (BS) demand certain rates. These users interfere with each other and one needs an algorithm that satisfies the demands irrespective of the number of interferers and the amount of interference (whenever the demands are within the achievable limits). In our previous paper, we proposed one such iterative power allocation algorithm called UPAMCN (Universal power allocation algorithm for multicell networks), when all the agents update their power profiles at the same rate. Using two time scale stochastic approximation analysis, we analyze the same (UPAMCN) algorithm, when the heterogeneous agents update their power profiles at different rates. We obtain partial analysis of the algorithm using an ODE framework and demonstrate the convergence of the proposed algorithm via numerical examples and simulations.
Type de document :
Communication dans un congrès
WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.406-411, 2012
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00764241
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 12 décembre 2012 - 16:04:05
Dernière modification le : mercredi 29 novembre 2017 - 10:12:53
Document(s) archivé(s) le : mercredi 13 mars 2013 - 03:55:32

Fichier

p406-kavitha.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-00764241, version 1

Citation

Veeraruna Kavitha, Sreenath Ramanath, Merouane Debbah. Satisfying demands in heterogeneous networks. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.406-411, 2012. 〈hal-00764241〉

Partager

Métriques

Consultations de la notice

94

Téléchargements de fichiers

35