Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-00764241
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, December 12, 2012 - 4:04:05 PM
Last modification on : Monday, December 14, 2020 - 2:36:02 PM
Long-term archiving on: : Wednesday, March 13, 2013 - 3:55:32 AM

File

p406-kavitha.pdf
Explicit agreement for this submission

Identifiers

  • 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. ⟨hal-00764241⟩

Share

Metrics

Record views

140

Files downloads

54