Satisfaction Based Channel Allocation Scheme for Self-Organization in Heterogeneous Networks

The next-generation wireless networks are expected to become denser and more heterogeneous in order to boost the network capacity. However, densely deployed base stations (BSs) in heterogeneous networks (HetNets) can give rise to interference. On the other hand, a limited number of channels is allocated within the HetNets. Therefore, the efficient assignment of channels among BSs is considered to be an important issue. Furthermore, the density and heterogeneity of the networks motivate self-organizing resource management techniques. In this paper, we address the problem of channel allocation in HetNets, and propose a satisfaction based channel allocation algorithm. The problem is modeled as a game in satisfaction form, in which BSs act as the players with the constraint given by the loads at the BSs. The objective is to meet the data rate requirements of user equipments. In this regard, the BSs aim at seeking a satisfaction solution rather than the optimal one. In order to learn the satisfaction equilibrium, a fully distributed algorithm based on the individual utility is applied. Simulation results show that the proposed approach can increase the average BS's throughput compared to the benchmark algorithms.