Abstract
In PCS (personal communication systems) networks, location management deals with the problem of tracking down a mobile user. It involves two kinds of activ- ities: one is location updating and the other is paging [1]. Each cost for location updating and paging is significantly associated with each other and therefore, has a trade-off relationship to total signaling cost. Location management strategies, as implemented in current PCS networks and as presented in this literature, are based on spatially static location areas that are built by heuristics or aggregate statistics [1,2]. The static location areas are used identically for all mobile users, even though the mobility pattern and call arrival rate of each mobile user are diffierent spatially and temporally. Thus, the location management applied to same location areas for all mobile users suffers from the various mobile proper- ties of users. Consequently, these strategies can not efficiently reduce the total signaling cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Pitoura E. and Samaras G.: Data Management for Mobile Computing. Kluwer Academic, (1998)
Plassman D.: Location management strategy for mobile cellular networks of 3rd genetation. Proc. of IEEE Vehicular Technology Conf. (1995) 649–653
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil, JM., Hwang, CS. (1999). An Efficient Location Management by Optimal Location Area Partitioning in PCS Networks. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_33
Download citation
DOI: https://doi.org/10.1007/3-540-46674-6_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66856-5
Online ISBN: 978-3-540-46674-1
eBook Packages: Springer Book Archive