Efficient location area planning for personal communication systems

A central problem in personal communication systems is to optimize bandwidth usage, while providing Quality of Service (QoS) guarantees to mobile users. Network mobility management, and in particular, location management, consumes a significant portion of bandwidth, which is a necessary overhead for supporting mobile users. We focus our efforts on minimizing this overhead. Unlike previous works, we concentrate on optimizing existing schemes, and so the algorithms we present are easily incorporated into current networks. We present the first polynomial time approximation algorithms for minimum bandwidth location management. In planar graphs, our algorithm provably generates a solution that uses no more than a constant factor more bandwidth than the optimal solution. In general graphs, our algorithm provably generates a solution that uses just a factor O(log n) more bandwidth than optimal where n is the number of base stations in the network. We show that, in practice, our algorithm produces near-optimal results and outperforms other schemes that are described in the literature. For the important case of the line graph, we present a polynomial-time optimal algorithm. Finally, we illustrate that our algorithm can also be used for optimizing the handoff mechanism.

[1]  Nikhil Bansal,et al.  Correlation Clustering , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[3]  David J. Goodman,et al.  Dynamic location area management and performance analysis , 1993, IEEE 43rd Vehicular Technology Conference.

[4]  Ian F. Akyildiz,et al.  Mobility Management in Next Generation Wireless Systems , 1999, ICCCN.

[5]  I. G. Tollis.  Optimal partitioning of cellular networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[6]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.

[7]  Fumito Kubota,et al.  Statistical paging area selection scheme (SPAS) for cellular mobile communication systems , 1994, Proceedings of IEEE Vehicular Technology Conference (VTC).

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

[9]  Sajal K. Das,et al.  A selective location update strategy for PCS users , 1999, Wirel. Networks.

[10]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[12]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[13]  Jorng-Tzong Horng,et al.  Personal paging area design based on mobile's moving behaviors , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Thomas Haug,et al.  The GSM System for Mobile Communications , 1992 .

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

[16]  Christopher Rose,et al.  One-dimensional location area design , 2000, IEEE Trans. Veh. Technol..

[17]  Christopher Rose,et al.  Wireless subscriber mobility management using adaptive individual location areas for PCS systems , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[18]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1995, Wirel. Networks.

[19]  Sajal K. Das,et al.  LeZi-update: an information-theoretic approach to track mobile users in PCS networks , 1999, MobiCom.

[20]  Seizo Onoe,et al.  A new location updating method for digital cellular systems , 1991, [1991 Proceedings] 41st IEEE Vehicular Technology Conference.

[21]  Nicole Immorlica,et al.  Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques , 2003, Lecture Notes in Computer Science.

[22]  Amos Fiat,et al.  Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs , 2003, ESA.

[23]  Ian F. Akyildiz,et al.  Movement-based location update and selective paging for PCS networks , 1996, TNET.

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

[25]  I Chih-Lin,et al.  A Profile-Based Location Strategy and Its Performance , 1997, IEEE J. Sel. Areas Commun..

[26]  R. Steele,et al.  System aspects of cellular radio , 1995, IEEE Commun. Mag..

[27]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[28]  Bijan Jabbari,et al.  Network issues for wireless communications , 1995, IEEE Commun. Mag..

[29]  Ian F. Akyildiz,et al.  Mobile user location update and paging under delay constraints , 1995, Wirel. Networks.

[30]  Ian F. Akyildiz,et al.  Dynamic mobile user location update for wireless PCS networks , 1995, Wirel. Networks.

[31]  Éva Tardos,et al.  Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs , 1993, Inf. Process. Lett..

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

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

[34]  Victor C. M. Leung,et al.  Location management for next-generation personal communications networks , 2000, IEEE Netw..

[35]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

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

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

[38]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[39]  Vicente Casares Giner,et al.  Reducing location update and paging costs in a PCS network , 2002, IEEE Trans. Wirel. Commun..

[40]  Sumita Mishra,et al.  Most recent interaction area and speed-based intelligent paging in PCS , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

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