loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Dynamic Location Update for PCS Networks with Consideration of MT Mobility Patterns
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
ASCII Text
x 
 
Jie Li, Atushi Kubota, Hisao Kameda, "Dynamic Location Update for PCS Networks with Consideration of MT Mobility Patterns," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 527, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2004.1300532,
author = {Jie Li and Atushi Kubota and Hisao Kameda},
title = {Dynamic Location Update for PCS Networks with Consideration of MT Mobility Patterns},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2004},
issn = {1087-4089},
pages = {527},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300532},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Dynamic Location Update for PCS Networks with Consideration of MT Mobility Patterns
SN - 1087-4089
SP
EP
A1 - Jie Li,
A1 - Atushi Kubota,
A1 - Hisao Kameda,
PY - 2004
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Jie Li, University of Tsukuba, Japan
Atushi Kubota, University of Tsukuba, Japan
Hisao Kameda, University of Tsukuba, Japan
This paper addresses the dynamic location update for personal communication service (PCS) networks. The four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). The shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. The optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. The analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.
Citation:
Jie Li, Atushi Kubota, Hisao Kameda, "Dynamic Location Update for PCS Networks with Consideration of MT Mobility Patterns," ispan, pp.527, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.