Efficient location area planning for cellular networks with hierarchical location databases

Location area planning (LAP) is an important issue in the design of high-performance PCS networks. It could have a serious impact on the total mobility management cost of mobile terminals. Most of the previous works either explored the LAP problem as a 0-1 linear programming problem or used adopted techniques, such as simulated annealing, taboo search, and genetic algorithms [IEEE Trans. Vehicular Technol. 49 (2000) 1678; Proceedings of 1999 Vehicular Technology Conference, vol. 4, 1999, pp. 2119-2123; IEEE Vehicular Technol. Conf. 3 (1996) 1835; Proceedings of IEEE INFOCOM'01, Anchorage, Alaska, April 2001; IEEE Trans. Vehicular Technol. 47 (1998) 987], to derive a solution to minimize the location update cost. In this paper, we model and resolve the LAP problem as a set-covering problem. The main advantage of this approach is that it can adapt to the changing mobility patterns of the mobile terminals. We propose the set-covering-based location area planning (SCBLP) algorithm to minimize the total number of location updates, in which the cost-benefit functions are defined based on the coupling and cohesive functions among neighboring cells. We then apply SCBLP to the location database system with a hierarchical structure to further improve the overall system performance in searching and updating the location databases. Extensive simulation experiments have been conducted, and the experimental results show that our proposed algorithms can significantly reduce the location management costs, compared to the greedy algorithm and the random algorithm.

[1]  Syed Zahid.  LOCATION MANAGEMENT IN CELLULAR MOBILE RADIO NETWORKS , 2002 .

[2]  Hakan Deliç,et al.  Location area planning in cellular networks using simulated annealing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Sandeep K. S. Gupta,et al.  On dynamically adapting registration areas to user mobility patterns in PCS networks , 1999, Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime.

[4]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[5]  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.

[6]  Israel Cidon,et al.  Efficient location management based on moving location areas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  M. Vudali.  The location area design problem in cellular and personal communications systems , 1996, Proceedings of ICUPC - 5th International Conference on Universal Personal Communications.

[8]  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).

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Chae Y. Lee,et al.  Cell planning with capacity expansion in mobile communications: a tabu search approach , 2000, IEEE Trans. Veh. Technol..

[12]  Raj Jain.  Reducing traffic impacts of PCS using hierarchical user location databases , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[13]  Kurt Tutschku,et al.  Demand-based radio network planning of cellular mobile communication systems , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Evaggelia Pitoura,et al.  Locating Objects in Mobile Computing , 2001, IEEE Trans. Knowl. Data Eng..

[15]  Janise McNair,et al.  Mobility management in current and future communications networks , 1998, IEEE Netw..

[16]  George L. Lyberopoulos,et al.  Evaluation of location area planning scenarios in future mobile telecommunication systems , 1995, Wirel. Networks.

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

[18]  Tei-Wei Kuo,et al.  Location management in cellular mobile computing systems with dynamic hierarchical location databases , 2004, J. Syst. Softw..

[19]  Ajit Pal,et al.  Dynamic location management with variable size location areas , 2001, Proceedings 2001 International Conference on Computer Networks and Mobile Computing.

[20]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  D. Munoz-Rodriguez,et al.  Optimal adaptive location area design and inactive location areas , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[23]  Amitava Mukherjee,et al.  Design of a personal communication services network (PCSN) for optimum location area size , 1997, 1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338).

[24]  A. Gamst.  Application of graph theoretical methods to GSM radio network planning , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[25]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[26]  Alfio Lombardo,et al.  A Methodology for the Performance Evaluation of Data Query Strategies in Universal Mobile Telecommunication Systems (UMTS) , 1995, IEEE J. Sel. Areas Commun..

[27]  Evaggelia Pitoura,et al.  An efficient hierarchical scheme for locating highly mobile users , 1998, CIKM '98.

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