Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications
DOI: 10.1109/icupc.1997.625528
|View full text |Cite
|
Sign up to set email alerts
|

Mobile location tracking by optimal paging zone partitioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0
1

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 5 publications
0
11
0
1
Order By: Relevance
“…If the number of cells passed by an MT is assumed to be a random variable with uniform distribution on [ ], the probability mass function and its transform can be represented as (12) Then, the pdf of the residence time in an LA has Laplace transform as (13) where is computed from (2). From the property of Laplace transform [7], the first-order moment, i.e., the mean value of the residence time in the LA, is (14) As shown in Fig.…”
Section: Calculation Of Intersystem Roaming Probabilitiesmentioning
confidence: 99%
“…If the number of cells passed by an MT is assumed to be a random variable with uniform distribution on [ ], the probability mass function and its transform can be represented as (12) Then, the pdf of the residence time in an LA has Laplace transform as (13) where is computed from (2). From the property of Laplace transform [7], the first-order moment, i.e., the mean value of the residence time in the LA, is (14) As shown in Fig.…”
Section: Calculation Of Intersystem Roaming Probabilitiesmentioning
confidence: 99%
“…It represents the exact amount of movements within the latest time period. Therefore, compared with the paging schemes choosing location probabilities as paging criterion [2,11,20,25], the proposed paging scheme results in better system performance, especially when there is some unusual changes to the normal value of user movements.…”
Section: Advantages Of the User Independent Paging Schemementioning
confidence: 99%
“…Therefore, when the system need not find MTs immediately, multi-step paging schemes are preferable. There are numerous link layer multi-step paging schemes proposed to reduce the paging cost [2,3,11,20,25]. A shortest-distancefirst (SDF) paging scheme is proposed in [3] where cells close to the last registered location are paged first.…”
Section: Introductionmentioning
confidence: 99%
“…In [26], average paging delay is considered to be a major performance metric and paging delay for two different paging schemes (based on directional random walk mobility and on dynamic location updating) are compared. In [27], LA is partitioned into PAs. An optimum partitioning is found so that the delay caused by congestion in the cellular forward control channel (paging channel) is reduced.…”
Section: Previous Workmentioning
confidence: 99%
“…Such an architecture can also guarantee that a micro-LA will not cross different macro-LAs, and additional operating load will not be generated at the boundaries of macro-LAs. To further reduce the cost and the paging delay, the distance-based [12] or the movement-based [13] location update scheme can be used in the macrocell tier, while the low-delay strategies for paging in the single-tier cellular network in [18], [20], [26], and [27] can be applied in the microcell tier.…”
Section: B Crossing-tier Schemementioning
confidence: 99%