Load-balanced location management for cellular mobile systems using quorums and dynamic hashing

  • Authors:

  • Ravi Prakash;Zygmunt Haas;Mukesh Singhal

  • Affiliations:

  • University of Texas, Dallas, Richardson, TX;Cornell University, Ithaca, NY;The Ohio State University, Columbus, OH and IEEE and National Science Foundation

  • Venue:
  • Wireless Networks
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.