This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Offline and Online Registration Techniques for Location Management with Overlapping Registration Areas
September/October 2005 (vol. 4 no. 5)
pp. 474-488
Personal Communication Services (PCS) standards such as the IS-41 and the GSM use a location management scheme which is based on registration areas (RA). Overlapping of registration areas has been proposed to reduce the overhead of location updates in such systems. Overlapping provides multiple choices for the selection of a registration area, a feature which does not appear in environments of nonoverlapping RAs. In this paper, we demonstrate how the choice of a registration area affects the number of subsequent registrations and define the problem of optimal choice based on minimization of subsequent registrations. We study two versions of the problem: 1) the deterministic (or offline) version, in which the entire trajectory of the mobile unit is known a priori, and 2) the stochastic (or online) version, in which the trajectory of the mobile unit is not known a priori, but the system has the knowledge of the mobility pattern of the mobile. The mobility pattern is modeled as a random walk across coverage area. In the deterministic case, the method presented computes an optimal solution to the registration problem. In the stochastic case, we present a method that determines the registration which minimizes the expected number of registrations by looking ahead in the probable future paths of the mobile unit. The algorithm's time complexity has exponential dependence on the length of the look-ahead. The cost of search is independent of the choice, therefore the algorithm does not increase the search cost. We also consider an alternative cost model for the stochastic case and propose a preemptive and a nonpreemptive approach each of which incurs different numbers of hard and soft registration operations. Simulation results show a reduction of 25-30 percent in number of registrations over a random-choice scheme. This can be translated to 5-20 percent effective location management load reduction for most cases, subject to the call-to-mobility ratio (CMR) of a mobile unit and search-cost-to-update-cost ratio (CCR) in the network.

[1] I.F. Akyildiz and W. Wang, “A Dynamic Location Management Scheme for Next-Generation Multi-Tier PCS Systems,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 178-189, Jan. 2002.
[2] Y. Bejerano and I. Cidon, “An Efficient Mobility Management Strategy for Personal Communication Systems,” Proc. IEEE/ACM Conf. Mobile Computing and Networking (MobiCom `98), pp. 215-222, Oct. 1998.
[3] Y. Bejerano and I. Cidon, “Efficient Location Management Based on Moving Location Areas,” Proc. IEEE InfoCom '01, pp. 3-12, Apr. 2001.
[4] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” Proc. ACM/IEEE Conf. Mobile Computing and Networking (MobiCom '99), pp. 1-12, Aug. 1999.
[5] T.X. Brown and S. Mohan, “Mobility Management for Personal Communications Systems,” IEEE Trans. Vehicular Technology, vol. 46, no. 2, pp. 269-278, May 2002.
[6] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Proc. Wireless Comm. and Mobile Computing (WCMC), special issue on mobile ad hoc networking: research, trends and applications, vol. 2, no. 5, pp. 483-502, 2002.
[7] T.-P. Chu and S.S. Rappaport, “Overlapping Coverage with Reuse Partitioning in Cellular Communication Systems,” IEEE Trans. Vehicular Technology, vol. 46, no. 1, pp. 41-54, Feb. 1997.
[8] D. Chung, H. Choo, H.Y. Youn, and S.-M. Yoo, “Efficient Location Traffic Management with Multiple Virtual Layers,” J. Information Science and Eng., vol. 19, no. 5, pp. 787-808, Sept. 2003.
[9] S.K. Das and S.K. Sen, “A New Location Update Strategy for Cellular Networks and Its Implementation Using a Genetic Algorithm,” Proc. ACM/IEEE Conf. Mobile Computing and Networking (MobiCom '97), pp. 185-194, Sept. 1997.
[10] S.K. Das and S.K. Sen, “Adaptive Location Prediction Strategies Based on a Hierarchical Network Model in a Cellular Mobile Environment,” The Computer J., vol. 42, no. 6, pp. 473-486, Mar. 1999.
[11] J. Jannink et al., “Efficient and Flexible Location Management Techniques for Wireless Communication Systems,” Proc. ACM/IEEE Conf. Mobile Computing and Networking (MobiCom `96), 1996.
[12] G. Fan, I. Stojmenovic, and J. Zhang, “A Triple Layer Location Management Strategy for Wireless Cellular Networks,” Proc. Int'l Conf. Computer Comm. and Networks, pp. 489-492, Oct. 2002.
[13] D. Gu and S.S. Rappaport, “Mobile User Registration in Cellular Systems with Overlapping Location Areas,” Proc. IEEE 49th Vehicular Technology Conf., vol. 1, pp. 16-20, May 1999.
[14] S.K.S. Gupta, G. Konjevod, and G. Varsamopoulos, “A Theoretical Study of Optimization Techniques Used in Registration Area Based Location Management: Models and Online Algorithms,” Proc. Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM 2002), pp. 72-79, Sept. 2002.
[15] A. Hac and X. Zhou, “Locating Strategies for Personal Communication Networks: A Novel Tracking Strategy,” IEEE J. Selected Areas in Comm., vol. 15, no. 8, pp. 1425-1436, 1997.
[16] J.S.M. Ho and I.F. Akyildiz, “Local Anchor Scheme for Reducing Location Tracking Costs in PCNS,” Proc. Conf. Mobile Computing and Networking (MobiCom `95), pp. 181-193, Nov. 1995.
[17] J.S.M. Ho and I.F. Akyildiz, “Dynamic Hierarchical Location Management in PCS Networks,” IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 646-660, Oct. 1997.
[18] L.-R. Hu and S.S. Rappaport, “Adaptive Location Management Scheme for Global Personal Communications,” Proc. IEE Comm., vol. 144, pp. 54-60, Feb. 1977.
[19] L.-R. Hu and S.S. Rappaport, “Personal Communication Systems Using Multiple Hierarchical Cellular Overlays,” IEEE J. Selected Areas in Comm., vol. 13, no. 2, pp. 406-415, Feb. 1995.
[20] T. Imielinski and B.R. Badrinath, “Querying in Highly Mobile Distributed Environments,” Proc. ACM SIGMOD Conf. Very Large Data Bases (VLDB '92), pp. 41-52, Aug. 1992.
[21] D.B. Johnson and D.A. Maltz, Mobile Computing, chapter on dynamic source routing in ad hoc wireless networks, pp. 153-181, Kluwer Academic Publishers, 1996.
[22] E. Jugl and H. Boche, “A New Mobility Model for Performance Evaluation of Future Mobile Communication Systems,” Proc. IEEE Int'l Conf. Computing '99, pp. 1751-1755, Aug. 1999.
[23] C.Y. Lee and S.G. Chang, “Determination of the Registration Point for Location Update by Dynamic Programming in PCS,” Wireless Networks, vol. 7, no. 4, pp. 331-341, Aug. 2001.
[24] B. Liang and Z.J. Haas, “Predictive Distance-Based Mobility Management for Multidimensional PCS Networks,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 718-733, Oct. 2003.
[25] K. Lim and Y.-H. Lee, “Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks,” IEEE Trans. Computers, vol. 46, no. 3, pp. 312-325, Mar. 1997.
[26] Y.-B. Lin, “Reducing Location Update Cost in a PCS Network,” IEEE/ACM Trans. Networking, vol. 5, no. 1, pp. 25-33, Feb. 1997.
[27] J.G. Markoulidakis, G.L. Lyberopoulos, D.F. Tsirkas, and E.D. Sykas, “Evaluation of Locations Area Planning Scenarios in Future Telecommunication Systems,” ACM-Baltzer J. Wireless Networks, vol. 1, no. 1, pp. 17-29, Feb. 1995.
[28] J.G. Markoulidakis, G.L. Lyberopoulos, D.F. Tsirkas, and E.D. Sykas, “Mobility Modeling in Third-Generation Mobile Telecommunications Systems,” IEEE Personal Comm., vol. 4, no. 4, pp. 41-56, Aug. 1997.
[29] K.S. Meier-Hellstern and E. Alonso, “The Use of SS7 and GSM to Support High Density Personal Communications,” Proc. IEEE Int'l Conf. Comm. (ICC '92), vol. 3, pp. 1698-1702, June 1992.
[30] S. Okasaka and S. Onoe, “A New Location Updating Method for Digital Cellular Systems,” Proc. IEEE Vehicular Technology Conf., pp. 345-350, May 1991.
[31] S. Okasaka, S. Onoe, S. Yasuda, and A. Maebara, “A New Location Updating Method for Digital Cellular Systems,” Proc. Conf. Vehicular Technology (VTC), pp. 345-350, May 1991.
[32] K. Pahlavan and P. Krishnamurthy, Principles of Wireless Networks: A Unified Approach. Prentice Hall, 2002.
[33] A.-C. Pang, Y.-B. Lin, and Y. Fang, “Implicit Deregistration with Forced Registration for PCS Mobility Management,” Wireless Networks, vol. 7, no. 1, pp. 99-104, Jan. 2001.
[34] G.P. Pollini and C.-L. I, “A Profile-Based Location Strategy and Its Performance,” IEEE J. Selected Areas in Comm., vol. 15, no. 8, pp. 1415-1424, Oct. 1997.
[35] R. Prakash, Z. Haas, and M. Singhal, “Load-Balanced Location Management for Cellular Mobile Systems Using Quorums and Dynamic Hashing,” Wireless Networks, vol. 7, pp. 497-512, 2001.
[36] T.S. Rappaport, Wireless Comm.: Principles and Practice, second ed. Prentice-Hall, 2002.
[37] N. Shivakumar and J. Widom, “User Profile Replication for Faster Location Lookup in Mobile Environments,” Proc. ACM/IEEE Conf. Mobile Computing and Networking (MobiCom `95), pp. 161-169, Nov. 1995.
[38] K.-L. Sue and C.-C. Tseng, “One-Step Pointer Forwarding Strategy for Location Tracking in Distributed HLR Environment,” IEEE J. Selected Areas in Comm., vol. 15, no. 8, pp. 1455-1466, Oct. 1997.
[39] L. Tassiulas and F.M. Anjum, “Efficient Location Tracking of Mobile Nodes for Situation Awareness,” Technical Report 97-47, Inst. for System Research, Univ. of Maryland at College Park, 1997.
[40] “Cellular Radio-Telecommunication Inter-System Operations,” TIA/EIA, IS-41, revision B, Technical Report, 1991.
[41] D. Tipper, T. Dahlberg, H. Shin, and C. Charnsripinyo, “Providing Fault Tolerance in Wireless Access Networks,” IEEE Comm. Magazine, vol. 40, no. 1, pp. 58-64, Jan. 2002.
[42] I.-F. Tsai and R.-H. Jan, “The Lookahead Strategy For Distance-Based Location Tracking in Wireless Cellular Networks,” Mobile Computing and Comm. Rev., vol. 3, no. 4, 27-38, Oct. 1999.
[43] G. Varsamopoulos and S.K.S. Gupta, “On Dynamically Adapting Registration Areas to User Mobility Patterns in PCS Networks,” Proc. Int'l Workshop Collaboration and Mobile Computing (IWCMC '99), pp. 108-113, Sept. 1999.
[44] G. Varsamopoulos and S.K.S. Gupta, “On Finding Optimal Registrations in Presence of Overlapping Registration Areas,” Proc. Workshop Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '01), pp. 77-86, July 2001.
[45] G. Varsamopoulos and S.K.S. Gupta, “Dynamically Adapting Registration Areas to User Mobility and Call Patterns for Efficient Location Management in PCS Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 9, pp. 837-890, Oct. 2004.
[46] W. Wang and I.F. Akyildiz, “Inter-System Location Update and Paging Schemes for Multi-Tier Wireless Networks,” Proc. Conf. Mobile Computing and Networking (MobiCom `00), pp. 99-109, Aug. 2000.
[47] W. Wang and I.F. Akyildiz, “A New Random Walk Model for PCS Networks,” IEEE J. Selected Areas in Comm., vol. 18, no. 7, pp. 1254-1260, July 2002.
[48] H.-K. Wu, M.-H. Jin, J.-T. Horng, and C.Y. Ke, “Personal Paging Area Design Based on Mobile's Moving Behaviors,” Proc. IEEE InfoCom `01, vol. 1, pp. 21-30, Apr. 2001.
[49] X. Zhang, J. Gomez Castellanos, and A.T. Campbell, “P-MIP: Paging Extensions for Mobile IP,” Kluwer Mobile Networks and Applications, vol. 2, no. 7, pp. 127-141, Apr. 2002.
[50] R. Jain, Y.B. Lin, C.N. Lo, and S. Mohan, “A Caching Strategy to Reduce Network Impacts of PCS,” IEEE J. Selected Areas in Comm., vol. 12, no. 8, pp. 1434-1445, Oct. 1994.

Index Terms:
Index Terms- Location management, mobile communication network, cellular network, online algorithm, optimization, overlapping registration area.
Citation:
Georgios Varsamopoulos, Sandeep Kumar S. Gupta, "Optimal Offline and Online Registration Techniques for Location Management with Overlapping Registration Areas," IEEE Transactions on Mobile Computing, vol. 4, no. 5, pp. 474-488, Sept.-Oct. 2005, doi:10.1109/TMC.2005.69
Usage of this product signifies your acceptance of the Terms of Use.