A completely distributed algorithm for user association in HetSNets
Zoubeir Mlika, Elmahdi Driouch, Wessam Ajib, Halima Elbiaze · 2015
In this paper, the user association problem under quality of service (QoS) requirements in a heterogeneous and small cells network (HetSNet) is considered. We have shown in a previous work that this problem is NP-hard and thus cannot be solved optimally in polynomial time unless P = NP. Therefore, new suboptimal algorithms are needed in order to solve it efficiently. Even though, it is very hard to implement the suboptimal algorithm in a centralized fashion because it needs a high amount of information exchange between the base stations and the users and it suffers from a huge computational complexity. Thus, in this paper, we model the problem of user association in HetSNets as a non-cooperative game and we propose a completely distributed algorithm inspired by the theory of learning to solve it. Specifically, we propose a modified win-stay-lose-shift learning model in order to converge to a near optimal user association. We evaluate by simulations the performance of the proposed algorithm and and we show that it is close to the performance of the computationally complex optimal centralized algorithm which assumes complete channel information knowledge.