Load Balancing in Heterogeneous Networks Based on Distributed Learning in Potential Games - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Load Balancing in Heterogeneous Networks Based on Distributed Learning in Potential Games

(1, 2) , (3) , (1, 2)
1
2
3

Abstract

We present a novel approach for distributive load balancing in heterogeneous networks that use cell range expansion (CRE) for user association. First, we formulate the problem as a minimisation of an alpha fairness objective function. Depending on alpha, different objectives in terms of network performance or fairness can be achieved. Next, we model the interactions among the base stations for load balancing as a potential game, in which the potential function is the alpha fairness function. The optimal Nash equilibrium of the game is found by using distributed learning algorithms. We use log-linear and binary log-linear learning algorithms for complete and partial information settings, respectively. By running extensive simulations, we show that the proposed algorithms converge within a few tens of iterations. The convergence speed in the case of partial information setting is comparable to that of the complete information setting. We also show that the best response algorithm does not necessarily converge to the optimal Nash equilibrium.
Fichier principal
Vignette du fichier
inproceedings-2015-15394-4.pdf (370.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01144144 , version 1 (24-10-2015)

Identifiers

  • HAL Id : hal-01144144 , version 1

Cite

Mohammed Shabbir Ali, Pierre Coucheney, Marceau Coupechoux. Load Balancing in Heterogeneous Networks Based on Distributed Learning in Potential Games. International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), May 2015, Mumbai, India. pp.1-8. ⟨hal-01144144⟩
159 View
588 Download

Share

Gmail Facebook Twitter LinkedIn More