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

@inproceedings{citeulike:817808, abstract = {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.}, author = {Li, Jiangdong and Zygmunt and Haas, J. and Liang, Ben }, citeulike-article-id = {817808}, journal = {Communications, 2003. ICC '03. IEEE International Conference on}, keywords = {locality, manet, qos}, pages = {313--317 vol.1}, posted-at = {2006-09-10 05:06:02}, priority = {2}, title = {Performance analysis of random database group scheme for mobility management in ad hoc networks}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1204191}, volume = {1}, year = {2003} }

TY - CONF ID - citeulike:817808 L3 - citeulike-article-id:817808 TI - Performance analysis of random database group scheme for mobility management in ad hoc networks JF - Communications, 2003. ICC '03. IEEE International Conference on VL - 1 SP - 313 EP - 317 vol.1 N2 - 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. KW - locality KW - manet KW - qos AU - Li, Jiangdong AU - Zygmunt AU - Haas, J AU - Liang, Ben PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1204191 ER -