Abstract
This paper presents a new distributed location management strategy for cellular mobile systems. Its salient features are fast location update and query, load balancing among location servers, and scalability. The strategy employs dynamic hashing techniques and quorums to manage location update and query operations. The proposed strategy does not require a home location register (HLR) to be associated with each mobile node. Location updates and queries for a mobile node are multicast to subsets of location servers, which change with time depending on the location of mobile node/querying node and load on the servers. Simulation experiments demonstrate that such dynamism prevents situations of heavy load on some location servers when mobile nodes are not uniformly distributed in space, or when some mobile nodes have their location updated or queried more often than others. Also, queries return the latest location information of a mobile node with a very high probability. The proposed scheme requires at most one unicast and two rounds of message multicasting for location update and query operations. All multicast messages have a small payload and are restricted to the high bandwidth wired part of the mobile network resulting in low communication overhead. Moreover, if a quorum of location servers gets overloaded, part of its load can be transferred to another lightly loaded quorum using dynamic hashing techniques.
Similar content being viewed by others
References
D. Agrawal and A. El Abbadi, Resilient logical structures for efficient management of replicated data, in: Proceedings of the 18th VLDB Conference, Vancouver (1992) pp. 151–162.
I.F. Akyildiz and J.S.M. Ho, On location management for personal communications networks, IEEE Communications Magazine (September 1996) 138–145.
I.F. Akyildiz, J.S.M. Ho and Y.-B. Lin, Movement based location update and selective paging schemes, IEEE/ACM Transactions on Networking (August 1996).
B. Awerbuch and D. Peleg, Online tracking of mobile users, Journal of the Association for Computing Machinery 42(5) (September 1995) 1021–1058.
A. Bar-Noy and I. Kessler, Tracking mobile users in wireless communication networks, in: Proceedings of IEEE INFOCOM (1993) pp. 1232–1239.
A. Bar-Noy, I. Kessler and M. Sidi, Mobile users: To update or not toupdate? in: Proceedings of IEEE INFOCOM (1994) pp. 570–576.
S. Chia, The universal mobile telecommunications system, IEEE Communications Magazine 30(12) (December 1992) 54–62.
G. Colombo, L. De Martino, C. Eynard and L. Gabrielli, Mobility control load in future personal communication networks, in: Proceedings of the International Conference on Universal Personal Communication (ICUPC'93), Ottawa, Canada (October 1993) pp. 113–117.
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press-McGraw-Hill, 1990).
EIA/TIA IS-41 Rev. C, Cellular Radio Telecommunications Intersystem Operations, PN-2991 (November 1995).
R.J. Enbody and H.C. Du, Dynamic hashing schemes, ACM Computing Surveys 20(2) (June 1988) 85–113.
C. Eynard, M. Lenti, A. Lombardo, O. Marengo and S. Palazzo, A methodology for the performance evaluation of data query strategies in universal mobile telecommunication systems (UMTS), IEEE Journal on Selected Areas in Communications 13(5) (June 1995) 893–907.
Z.J. Haas and B. Liang, Ad hoc location management using quorum systems, ACM/IEEE Transactions on Networking (April 1999).
J.S.M. Ho and I.F. Akyildiz, Local anchor scheme for reducing location tracking costs in PCNS, in: Proceedings of Mobicom (ACM, 1995) pp. 181–193.
R. Jain, Y.-B. Lin and S. Mohan, A caching strategy to reduce networkimpacts of PCS, IEEE Journal on Selected Areas in Communications 12(8) (October 1994) 1434–1444.
R. Jain, Y.-B. Lin and S. Mohan, A forwarding strategy to reduce network impacts of PCS, in: Proceedings of IEEE INFOCOM (1995) pp. 481–489.
R. Jain, S. Rajagopalan and L.F. Chang, Phone number portability for PCS systems with ATM backbones using distributed dynamic hashing, IEEE Journal on Selected Areas in Communications 15(1) (January 1997) 96–105.
G. Karumanchi, S. Muralidharan and R. Prakash, Information dissemination in partitionable mobile ad hoc networks, in: Proceedings of the IEEE Symposium on Reliable Distributed Systems (SRDS), Lausanne, Switzerland (October 1999) pp. 4–13.
P. Krishna, N.H. Vaidya and D.K. Pradhan, Static and adaptive location management in mobile wireless networks, Journal of Computer Communications 19(4) (March 1996).
M. Mouly and M.B. Pautet, The GSM System for Mobile Communications (Palaiseau, France, 1992).
S.J. Mullender and P.M.B. Vitányi, Distributed match-making, Algorithmica 3 (1988) 367–391.
M.R. Pearlman and Z.J. Haas, Determining the optimal configuration for the zone routing protocol, IEEE Journal on Selected Areas in Communications 17(8), Special Issue on Ad Hoc Networks (August 1999).
D. Peleg and A. Wool, Crumbling walls: A class of practical and efficient quorum systems, in: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, Ottawa (August 1995) pp. 120–129.
R. Prakash, Z.J. Haas and M. Singhal, Load balanced location management for mobile systems using dynamic hashing and quorums, Technical report UTDCS–05–97, The University of Texas at Dallas (October 1997).
S. Rajagopalan and B.R. Badrinath, An adaptive location management strategy for mobile IP, in: Proceedings of ACM MOBICOM'95 (November 1995).
C. Rose and R. Yates, Minimizing the average cost of paging under delay constraints, Wireless Networks 1(2) (July 1995) 211–219.
N. Shivakumar and J. Widom, User profile replication for faster location lookup in mobile environments, in: Proceedings of ACM MOBICOM' 95 (November 1995) pp. 161–169.
J.Z. Wang, A fully distributed location registration strategy for universal personal communication systems, IEEE Journal on Selected Areas in Communications 11 (August 1993) 850–860.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Prakash, R., Haas, Z. & Singhal, M. Load-Balanced Location Management for Cellular Mobile Systems Using Quorums and Dynamic Hashing. Wireless Networks 7, 497–512 (2001). https://doi.org/10.1023/A:1016774627097
Issue Date:
DOI: https://doi.org/10.1023/A:1016774627097