Base Station Association in Wireless Cellular Networks: An Emulation Based Approach

In order to utilize network resources efficiently and reduce regional congestion, associating mobile stations (MSs) with proper base stations (BSs) is of crucial importance in wireless cellular networks. There have been several load-aware proposals in literature, where most are classified into so-called closed-form approaches. In such approaches, each MS independently and deterministically selects the BS which is expected to provide the highest throughput. The throughput is estimated by a closed-form equation based on the assumption of the Proportional Fair (PF) user scheduler that ensures temporal fairness. However, the closed-form approaches do not perform well when the closed-form equation is not available, e.g., general α-fair user scheduler, where temporal fairness is not guaranteed, or deterministic BS association may make wrong decisions, e.g., under the dynamics of mobility or flow arrivals/departures. In this paper, we propose a novel BS association scheme, called ViSE (Virtual Scheduling based Emulation) to tackle such challenges. It emulates an optimal BS association by running a notion of virtual scheduler, and each MS randomly determines its associated BS with the probability proportional to the throughput virtually allocated by the virtual scheduler. We demonstrate through extensive simulations under various practical scenarios that ViSE outperforms the existing algorithms in terms of user schedulers with diverse fairness and robustness to network dynamics.