Network performance model for location area re-planning in GERAN

In mobile networks, location area (LA) planning has a strong influence on network performance. This paper addresses the problem of optimising an existing LA plan in a live GSM-EDGE radio access network (GERAN) based on statistical measurements. Unlike prior work, where the quality of an LA plan was assessed based on the number of location update and paging requests, the main focus in this paper is on estimating the impact of changing the LA plan on the air-interface signalling load. For this purpose, a performance model is proposed to estimate changes in the traffic load in dedicated signalling channels. With such a model, it is possible to estimate the change that a new LA plan will cause in terms of the required number of signalling channels in the whole network, providing an indication of the capacity benefit obtainable, which is a more significant figure of merit for operators. Model assessment is carried out based on measurements taken before and after changing the LA plan of a limited geographical area in a live network. Then, a comparison of several LA re-planning algorithms is performed over measurements in a larger area by using the proposed performance model. Results show that the signalling traffic (and, hence, the required signalling resources) can be significantly reduced by improving the existing LA plan in a live GERAN system.

[1]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .

[2]  William Cyrus Navidi,et al.  Statistics for Engineers and Scientists , 2004 .

[3]  E. D. Sykas,et al.  Intelligent paging strategies for third generation mobile telecommunication systems , 1995 .

[4]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[5]  WilleVolker,et al.  Performance Analysis of Dedicated Signalling Channels in GERAN by Retrial Queues , 2011 .

[6]  Matías Toril,et al.  Dimensioning of signaling capacity on a cell basis in GSM/GPRS , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[7]  Sami Tabbane,et al.  An Alternative Strategy for Location Tracking , 1995, IEEE J. Sel. Areas Commun..

[8]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[9]  Volker Wille,et al.  Analysis of User Mobility Statistics for Cellular Network Re-Structuring , 2009, VTC Spring 2009 - IEEE 69th Vehicular Technology Conference.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Hakan Deliç,et al.  Location area planning and cell-to-switch assignment in cellular networks , 2004, IEEE Transactions on Wireless Communications.

[12]  Rudra Pratap.  Getting Started with MATLAB: Version 6: A Quick Introduction for Scientists and Engineers , 2002 .

[13]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[14]  Tei-Wei Kuo,et al.  Efficient location area planning for cellular networks with hierarchical location databases , 2004, Comput. Networks.

[15]  Matías Toril,et al.  Performance Analysis of Dedicated Signalling Channels in GERAN by Retrial Queues , 2011, Wirel. Pers. Commun..

[16]  Chien-Chao Tseng,et al.  A direction-based location update scheme with a line-paging strategy for PCS networks , 2000, IEEE Communications Letters.

[17]  J. Plehn,et al.  The design of location areas in a GSM-network , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[18]  Matías Toril,et al.  Optimization of the Assignment of Base Stations to Base Station Controllers in GERAN , 2008, IEEE Communications Letters.

[19]  T. Kurner,et al.  Performance of traffic and mobility models for location area code planning , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[20]  P.R.L. Gondim,et al.  Genetic algorithms and the location area partitioning problem in cellular networks , 1996, Proceedings of Vehicular Technology Conference - VTC.

[21]  Rajesh Krishnan,et al.  Optimization algorithms for large self-structuring networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[22]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[23]  Nicole Immorlica,et al.  Efficient location area planning for personal communication systems , 2003, IEEE/ACM Transactions on Networking.

[24]  Tobias Achterberg,et al.  SCIP - a framework to integrate Constraint and Mixed Integer Programming , 2004 .

[25]  Chien-Chao Tseng,et al.  Registration area planning for PCS networks using genetic algorithms , 1998 .

[26]  Ian F. Akyildiz,et al.  Optimal Location Area Design to Minimize Registration Signaling Traffic in Wireless Systems , 2003, IEEE Trans. Mob. Comput..

[27]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[28]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[29]  Richard D. Gitlin,et al.  PCS mobility management using the reverse virtual call setup algorithm , 1997, TNET.

[30]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[31]  Matías Toril,et al.  Optimization of the assignment of cells to packet control units in GERAN , 2006, IEEE Communications Letters.

[32]  Guang Wan,et al.  A dynamic paging scheme for wireless communication systems , 1997, MobiCom '97.

[33]  Panagiotis Demestichas,et al.  Control of the location update and paging signaling load in cellular systems by means of planning tools , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[34]  Jack Dongarra,et al.  Sourcebook of parallel computing , 2003 .

[35]  I Chih-Lin,et al.  A profile-based location strategy and its performance , 1996, Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications.

[36]  Christopher Rose,et al.  State-based paging/registration: a greedy technique , 1999 .

[37]  Zygmunt J. Haas,et al.  Predictive distance-based mobility management for PCS networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[38]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[39]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[40]  Anshul Gupta,et al.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997, IBM J. Res. Dev..