Dynamic Paging and Location Management Algorithm for Reducing Location Update Overhead in A Microcell Environment


The KIPS Transactions:PartC, Vol. 8, No. 5, pp. 677-682, Oct. 2001
10.3745/KIPSTC.2001.8.5.677,   PDF Download:

Abstract

In a microcell environment having frequent inter-cell movement of a subscriber, the amount of signalling traffic rapidly increases due to the treatment of location update and other necessary actions. As a way to reduce such an overhead, this paper presents an algorithm that dynamically allocates subscribers paging and location areas each of which has a different size and shape, depending on the characteristics of subscriber mobility. Mathematical analysis results show that this algorithm allows reduced area management cost, compared to conventional algorithms.


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]
Y. S. Jang, S. K. Oh, S. Y. Lee, "Dynamic Paging and Location Management Algorithm for Reducing Location Update Overhead in A Microcell Environment," The KIPS Transactions:PartC, vol. 8, no. 5, pp. 677-682, 2001. DOI: 10.3745/KIPSTC.2001.8.5.677.

[ACM Style]
Young Sang Jang, Sam Kweon Oh, and Sung Yooung Lee. 2001. Dynamic Paging and Location Management Algorithm for Reducing Location Update Overhead in A Microcell Environment. The KIPS Transactions:PartC, 8, 5, (2001), 677-682. DOI: 10.3745/KIPSTC.2001.8.5.677.