A novel load-balancing scheme for cellular-WLAN heterogeneous systems with cell-breathing technique

This paper proposes a novel load-balancing scheme for an operator-deployed cellular-wireless local area network (WLAN) heterogeneous network (HetNet), where the user association is controlled by employing a cell-breathing technique for the WLAN network. This scheme eliminates the complex coordination and additional signaling overheads between the users and the network by allowing the users to simply associate with the available WLAN networks similar to the traditional WLAN-first association, without making complex association decisions. Thus, this scheme can be easily implemented in an existing operator-deployed cellular-WLAN HetNet. The performance of the proposed scheme is evaluated in terms of load distribution between cellular and WLAN networks, user fairness, and system throughput, which demonstrates the superiority of the proposed scheme in load distribution and user fairness, while optimizing the system throughput. In addition, a cellular-WLAN interworking architecture and signaling procedures are proposed for implementing the proposed load-balancing schemes in an operator-deployed cellular-WLAN HetNet

Partially-Distributed Resource Allocation in Small-Cell Networks

We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide results of numerical simulations to illustrate the efficacy of our scheme.Comment: Accepted on May 15, 2014 for publication in the IEEE Transactions on Wireless Communication