Cell Selection in 4G Cellular Networks

被引:30
作者
Amzallag, David [1 ]
Bar-Yehuda, Reuven [2 ]
Raz, Danny [2 ]
Scalosub, Gabriel [3 ]
机构
[1] Amdocs Ltd, IL-52960 Ramat Efal, Israel
[2] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[3] Ben Gurion Univ Negev, IL-84105 Beer Sheva, Israel
关键词
Cellular networks; 4G; WiMAX; LTE-advanced; approximation algorithms; cell selection; association; resource allocation; SITE SELECTION; APPROXIMATION; ALGORITHM;
D O I
10.1109/TMC.2012.83
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1443 / 1455
页数:13
相关论文
共 28 条
[1]  
Amzallag D., 2005, 6th IEE International Conference on 3G and Beyond, P501, DOI 10.1049/cp:20050272
[2]  
AMZALLAG D, 2008, CS200804 TECHN ISR I
[3]  
Amzallag D, 2006, LECT NOTES COMPUT SC, V4368, P29
[4]   Logarithmic hardness of the undirected edge-disjoint paths problem [J].
Andrews, Matthew ;
Zhang, Lisa .
JOURNAL OF THE ACM, 2006, 53 (05) :745-761
[5]  
[Anonymous], 2009, 36913 3GPP TR
[6]   One for the price of two: a unified approach for approximating covering problems [J].
Bar-Yehuda, R .
ALGORITHMICA, 2000, 27 (02) :131-144
[7]   A polynomial time approximation scheme for the multiple knapsack problem [J].
Chekuri, C ;
Khanna, S .
SIAM JOURNAL ON COMPUTING, 2006, 35 (03) :713-728
[8]  
Chekuri C., 2005, P 37 ANN ACM S THEOR, P183
[9]  
Chekuri C., 2004, P 36 ANN ACM S THEOR, P156
[10]   An efficient approximation for the Generalized Assignment Problem [J].
Cohen, Reuven ;
Katzir, Liran ;
Raz, Danny .
INFORMATION PROCESSING LETTERS, 2006, 100 (04) :162-166