Adaptive Location Management in Mobile Environments
Location management in mobile environments consists of two major operations: location update and paging. The more up-to-date the location information, the less paging becomes necessary and vice versa. The conventional approach is the location area based approach (LA-based approach), where a location area (LA) consists of multiple cells. When the mobile station (MS) enters a new location area, the MS immediately updates its location information at the new location’s visitor location register (VLR) and this update is propagated to the MS’s home location register (HLR). The major drawback of the LA-based approach is that it does not consider any mobility patterns, or call arrival patterns. Moreover, MS updates frequently when it roams only within the boundary cells of different location areas, resulting in unnecessary location updates. So, there is a need for an efficient algorithm which can eliminate the drawbacks of the LA-based approach. To this end, an adaptive location management algorithm is described in this paper: an MS dynamically determines whether or not to update when it moves to a new LA, so that each location update becomes a necessary location update, i.e., in each updated location area at least one call is made. We have conducted experiments to capture the effect of mobility and call arrival patterns on the new location update strategy. We have also tested our algorithm with SUMATRA (Stanford University Mobile Activity TRAces), which has been validated against real data on call and mobility traces. Experimental results show that our adaptive location management algorithm considerably reduces the location management cost, by avoiding unnecessary location updates.
KeywordsMobile Station Location Update Visitor Location Register Home Location Register Public Switch Telephone Network
Unable to display preview. Download preview PDF.
- 1.Ben Liang and Zygmunt J. Haas, Predictive Distance-Based Mobility Management for PCS Networks, IEEE INFOCOM’99, March 21–25, 1999.Google Scholar
- 2.Guang Wan and Eric Lin, Dynamic Paging Scheme for Wireless Communication Systems, Mobile Computing and Networking, 1997.Google Scholar
- 3.H. Xie, S. Tabbane and D. Goodman, Dynamic Location Area Management and Performance analysis, In Proceedings of IEEE, VTC, May 1993.Google Scholar
- 4.Ian F. Akyildiz and Joseph S.M. Ho, A Mobile User Location Update and Paging Mechanism Under Delay constraints, ACM Wireless Networks, 1995.Google Scholar
- 5.I-Fei Tsai and Rong-Hong Jan, The Look-ahead Strategy for Distance-Based Location Tracking in Wireless Cellular Networks, IEEE Real-Time Systems Symposium, Madrid, Spain, December 2–4, 1998.Google Scholar
- 6.John Scourias and Thomas Kunz, A dynamic Individualized Location Management Algorithm, 10th International World Wide Web Conference, Hong Kong, May 2001.Google Scholar
- 7.Sanjoy k. Sen, Amiya Bhattacharya and Sajal K. Das, A Selective Location Update Strategy for PCS users, IEEE Network Magazine, 14(3):6–14, May 2000.Google Scholar
- 8.Wenye Wang, Ian F. Akyildiz and Gordon L. Stuber, Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems, In proceedings of 1996 USENIX Technical Conference, January 1996.Google Scholar
- 9.Yigal Bejerano, Israel Cidon, Location Management Based on Moving Location areas, IEEE Infocom 2001.Google Scholar