1995
DOI: 10.1007/bf01202541
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic mobile user location update for wireless PCS networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
54
0

Year Published

2002
2002
2016
2016

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 117 publications
(54 citation statements)
references
References 3 publications
0
54
0
Order By: Relevance
“…We further study how the optimal location inspection period is affected by the mean, variance, and memory level of a mobile's velocity. Previous work on distance-based mobility management schemes [2][5] [14] [21] do not incorporate this assumption.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We further study how the optimal location inspection period is affected by the mean, variance, and memory level of a mobile's velocity. Previous work on distance-based mobility management schemes [2][5] [14] [21] do not incorporate this assumption.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic mobility management schemes [2], [3], [5], [8], [14] [19], [21] discard the notion of LA borders altogether. A mobile in these schemes updates its location 1 based on either elapsed time, number of crossed cell borders, or traveled distance.…”
Section: Introductionmentioning
confidence: 99%
“…Our main focus in this paper is to compute the location update cost under generally distributed interservice time. In the current literature, three location update schemes were proposed and studied ( [3], [6]): distance-based location update, movement-based location update, and time-based location update. In the distance-based locate update scheme, location update will be performed when a mobile terminal moves d cells away from the cell in which the previous location update was performed, where d is a distance threshold.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, there is a trade off between the location update traffic and the paging traffic. The cost trade off analysis has been intensively studied in the current literature ( [1], [2], [3], [4], [6], [19], [20], [23]). …”
Section: Introductionmentioning
confidence: 99%
“…One current trend to minimize the LUP and paging costs uses adaptive and dynamic tracking and paging algorithms [2,3,4,5,6,7]. The main idea of these algorithms is to collect and compute more information about the user in order to find out an individual mobility and behavior pattern of the user.…”
Section: Introductionmentioning
confidence: 99%