Design and Evaluation of and Adaptive Distributed Dynamic Location Management Algorithm for Wireless Mobile Networks


The KIPS Transactions:PartC, Vol. 9, No. 6, pp. 911-918, Dec. 2002
10.3745/KIPSTC.2002.9.6.911,   PDF Download:

Abstract

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k, replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. K. Chun and I. H. Bae, "Design and Evaluation of and Adaptive Distributed Dynamic Location Management Algorithm for Wireless Mobile Networks," The KIPS Transactions:PartC, vol. 9, no. 6, pp. 911-918, 2002. DOI: 10.3745/KIPSTC.2002.9.6.911.

[ACM Style]
Sung Kwang Chun and Ihn Han Bae. 2002. Design and Evaluation of and Adaptive Distributed Dynamic Location Management Algorithm for Wireless Mobile Networks. The KIPS Transactions:PartC, 9, 6, (2002), 911-918. DOI: 10.3745/KIPSTC.2002.9.6.911.