Satisfying demands in heterogeneous networks

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.

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00670732
Author Kavitha, Veeraruna, Ramanath, Sreenath, Debbah, Merouane
Maintainer CCSD
Last Updated May 28, 2026, 04:07 (UTC)
Created May 28, 2026, 04:07 (UTC)
Identifier hal-00670732
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor SRM Research Institute [Bangalore] (SRM) ; SRM Research Institute
creator Kavitha, Veeraruna
date 2012-02-17T00:00:00
harvest_object_id 726b3c2b-f45d-4767-bed2-778072e283e4
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2020-12-14T00:00:00
set_spec type:UNDEFINED