Cell Selection in 4G Cellular Networks
Authors:
- 5 April 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 12 (7) , 1443-1455
Abstract
Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step toward maximizing the utilization of current and future cellular networks. We study the potential benefit of global cell selection versus the current local mobile SNR-based decision protocol. In particular, we study the new possibility available in OFDMA-based systems, such as IEEE 802.16m and LTE-Advanced, of satisfying the minimal demand of a mobile station simultaneously by more than one base station. We formalize the problem as an optimization problem, and show that in the general case this problem is not only NP-hard but also cannot be approximated within any reasonable factor. In contrast, under the very practical assumption that the maximum required bandwidth of a single mobile station is at most an r-fraction of the capacity of a base station, we present two different algorithms for cell selection. The first algorithm produces a (1-r)-approximate solution, where a mobile station can be covered simultaneously by more than one base station. The second algorithm produces a 1-r/2-r-approximate solution, while every mobile station is covered by at most one base station. We complete our study by an extensive simulation study demonstrating the benefits of using our algorithms in high-loaded capacity-constrained future 4G networks, compared to currently used methods. Specifically, our algorithms obtain up to 20 percent better usage of the network's capacity, in comparison with the current cell selection algorithms.Keywords
This publication has 24 references indexed in Scilit:
- An efficient approximation for the Generalized Assignment ProblemInformation Processing Letters, 2006
- Logarithmic hardness of the undirected edge-disjoint paths problemJournal of the ACM, 2006
- Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systemsWireless Networks, 2006
- Tight approximation algorithms for maximum general assignment problems2006
- Multicommodity flow, well-linked terminals, and routing problems2005
- Packet scheduling with fragmentation2003
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacityIEEE Journal on Selected Areas in Communications, 1995
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972