By Topic

Performance analysis of random database group scheme for mobility management in ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jiangdong Li ; State Key Lab of ISN, Xidian Univ., Xi'an, China ; Haas, J. ; Ben Liang

In this paper, the performance of a distributed mobility management scheme, the Randomized Database Group (RDG), for mobile ad hoc networks is presented. In this scheme, databases are used to store the location of the network nodes and to manage the mobility of nodes. When a mobile's location changes, a number of randomly selected databases are updated. When a mobile's location is needed, such as upon a call arrival, a number of randomly selected databases are queried. A number of different RDG query schemes are studied and their performance are compared. In particular, the optimum update-group size and the query-group size are found. We also present the probability of the first query being successful and the average query delay to find the mobile's location. Finally, we estimate the cost of implementing the RDG scheme as a function of different number of databases.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:1 )

Date of Conference:

11-15 May 2003