This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Analytic Framework for Dynamic Mobility Management of PCS Networks
July-September 2002 (vol. 1 no. 3)
pp. 208-220

Abstract—This paper presents a new analytic framework for dynamic location management of PCS networks. Based on the theory of hexagonal cellular patterns, a novel two-dimensional Markov walk model with six states is proposed to characterize the dynamic behavior of the intercell movements for a mobile station. We discover a broad class of isotropic processes having an identical uniform steady-state distribution of the six directions, but distinct circulant transition probability matrices. Six special isotropic processes exhibiting IID, directional, turning, ping-pong, h-spin, and t-spin mobility patterns are identified for performance comparison. We also generalize the selective paging strategy by introducing the concept of probabilistic selective paging (PSP) to reduce the paging cost. A unified analysis using recursive computations is carried out to compute the exact probability distribution for the number of per-call location updates. We calculate the location profile with respect to an incoming call and derive an exact expression of the average paging cost for PSP. With its ability to distinguish subtle performance variations and unveil new features of various dynamic location management schemes, our analytic framework is demonstrated to provide more precise and insightful results than conventional analysis.

[1] V.W.-S. Wong and V.C.M. Leung, “Location Management for Next-Generation Personal Communications Networks,” IEEE Network Magazine, pp. 18-24, Sept./Oct. 2000.
[2] J.S.M. Ho and I. F. Akyildiz, “On Location Management for Personal Communications Networks,” IEEE Comm. Magazine, pp. 138-145, Sept. 1996.
[3] A. Bar-Nor, I. Kessler, and M. Sidi, “Mobile Users: To Update or Not to Update,” ACM-Baltzer Wireless Networks, vol. 1, no. 2, pp. 187-196, 1994.
[4] J.S.M. Ho and I.F. Akyildiz, “Mobile User Location Update and Paging under Delay Constraints,” ACM-Baltzer Wireless Networks, vol. 1, no. 4, pp. 413-425, 1995.
[5] I.F. Akyildiz, J.S.M. Ho, and Y.B. Lin, “Movement-Based Location Update and Selective Paging for PCS Networks,” IEEE/ACM Trans. Networking, vol. 4, pp. 629-638, Aug. 1996.
[6] V. Casares-Giner and J. Mataix-Oltra, “On Movement-Based Mobility Tracking Strategy—An Enhanced Version,” IEEE Comm. Letters, vol. 2, no. 2, pp. 45-47, Feb. 1998.
[7] J.S.M. Ho and J. Xu, “History-Based Location Tracking for Personal Communications Networks,” Proc. IEEE Vehicular Technology Conf. (VTC '98), vol. 1, pp. 244-248, 1998.
[8] H.-W. Hwang, M.-F. Chang, and C.-C. Tseng, “A Direction Based Location Update Scheme with a Line-Paging Strategy for PCS Networks,” IEEE Comm. Letters, vol. 4, no. 5, pp. 149-151, May 2000.
[9] C. Rose and R. Yates, “Minimizing the Average Cost of Paging under Delay Constraints,” ACM-Baltzer Wireless Networks, vol. 1, no. 2, pp. 211-219, 1995.
[10] A. Abutaleb and V.O.K. Li, “Paging Strategy Optimization in Personal Communication Systems,” ACM-Baltzer Wireless Networks, vol. 3, no. 3, pp. 195-204, 1997.
[11] A. Yener and C. Rose, “Highly Mobile Users and Paging: Optimal Polling Strategies,” IEEE Trans. Vehicular Technology, vol. 47, no. 4, pp. 1251-1257, Nov. 1998.
[12] W. Wang, I.F. Akyildiz, and G. Stuber, “An Optimal Partition Algorithm for Minimization of Paging Costs,” IEEE Comm. Letters, vol. 5, no. 2, pp. 42-45, Feb. 2001.
[13] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” Proc. Fifth ACM/IEEE Ann. Conf. Mobile Computing and Networking (MOBICOM '99), pp. 1-12, Aug. 1999.
[14] D. Goodman, P. Krishnan, and B. Sugla, “Minimizing Queueing Delays and Number of Messages in Mobile Phone Location,” ACM-Baltzer Mobile Networks and Applications, vol. 1, no. 1, pp. 39-48, 1996.
[15] C. Rose and R. Yates, “Ensemble Polling Strategies for Increases Paging Capacity in Mobile Communication Networks,” ACM-Baltzer Wireless Networks, vol. 3, no. 2, pp. 159-167, 1997.
[16] W.H.A. Yuen and W.S. Wong, “A Contention-Free Mobility Management Scheme Based on Probabilistic Paging,” IEEE Trans. Vehicular Technology, vol. 50, no. 1, pp. 48-58, Jan. 2001.
[17] P.G. Escalle, V.C. Giner, and J.M. Oltra, “Reducing Location Update and Paging Costs in a PCS Network ,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 200-209, Jan. 2002.
[18] I.F. Akyildiz and W. Wang, “A Dynamic Location Management Scheme for Next-Generation Multitier PCS Systems,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 178-189, Jan. 2002.
[19] J.C.S. Lui, C.C.F. Fong, and H.W. Chan, “Location Updates and Probabilistic Tracking Algorithms for Mobile Cellular Networks,” Proc. Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 432-437, 1999.
[20] V.H. MacDonald, “The Cellular Concept,” AT&T Bell System Technical J., vol. 58, no. 1, pp. 15-41, Jan. 1979.
[21] G.H. Golub and C.F. Van Loan, Matrix Computations. Baltimore: Johns Hopkins Press, 1996.
[22] D.G. Luenberger, Linear and Nonlinear Programming. Reading, Mass.: Addison-Wesley, 1984.
[23] J.E. Wieselthier, G.D. Nguyen, A. Ephremides, and C.M. Barnhart, “Application of Optimization Techniques to a Nonlinear Problem of Communication Network Design with Nonlinear Constraints,” IEEE Trans. Automatic Control, vol. 47, no. 6, pp. 1033-1038, June 2002.
[24] S.M. Ross, Stochastic Processes. New York: Wiley, 1983.
[25] Y.-B. Lin, “Reducing Location Update Cost in a PCS Network,” IEEE/ACM Trans. Networking, vol. 5, no. 1, pp. 25-33, June 1997.

Index Terms:
Mobility management, Markov walk model, location update, probabilistic selective paging.
Citation:
Chien-Hsing Wu, Huang-Pao Lin, Leu-Shing Lan, "A New Analytic Framework for Dynamic Mobility Management of PCS Networks," IEEE Transactions on Mobile Computing, vol. 1, no. 3, pp. 208-220, July-Sept. 2002, doi:10.1109/TMC.2002.1081756
Usage of this product signifies your acceptance of the Terms of Use.