Abstract
In this work we have addressed the issue of inherent trade-off between location update cost and paging cost for proper location area (LA) planning and have attempted to find out an optimal LA size such that the total cost comprising of location update and paging can be minimized. We have formulated a constrained cost optimization problem under the known patterns of call arrival and terminal mobility. The present work is divided into two parts. First, we have tried to validate the model itself; next we have proposed an algorithm based on simulated annealing technique as a solution methodology for the hard constrained optimization problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sen, S. K. Bhattacharya, A., and Das, S. K.:“A Selective Location Update Strategy for PCS users”, ACM/Baltzer J. Wireless Networks, vol. 5, no. 5, pp 313–326, Sept.99.
Pollini, G.P., I, C. L.: “A Profile-Based Location Strategy and Its Performance”, IEEE JSAC, Vol. 15, no 8. pp. 1415–1424, Oct. 97.
Ho, J., Akyildiz, I. F.: “Mobile User Location Update and Paging under Delay Constraints”, ACM/Baltzer J. Wireless Networks, vol. 1, no. 4, pp. 413–25, Dec. 95.
Liang, B., Haas, Z.: “Predictive Distance-based Mobility Management for PCS Networks”, Proc. IEEE INFOCOM’99, NY, March 99.
Bhattacharya, A., Das, S. K.:“LeZi-Update: An Information-Theroretic Approach to Track Mobile Users in PCS networks”, Proc. of ACM/IEEE MobiCom’ 99, Settle, WA, pp. 1–12, Aug. 99.
Akyildiz, I. F., Ho, J. S. M., Lin, Yi-Bing.: “Movement-Based Location Update and Selective Pageng for PCS Networks”, IEEE/ACM Transactions on Networking, Vol_4., No. 4, Aug,96.
Saha, D., Mukherjee, A., Bhattacharya, P. S.: “Optimization of Location Area Size in a Hierarchical PCSN”, Conference on Distributed Processing and Networking, 97, pp 21–26, IIT, Kharagpur, India.
Bhattacharya, P.S., Saha, D., Mukherjee, A..“Determination of Optimum Size of a Location Area”, COMM_SPHERE 99, France.
van Laarhoven, P. J. M., Aarts, E. H. L.: “Simulated Annealing Theory and Applications”, Kluer Academic Publishers, London /Boston 87.
Maitra, M., Saha, D., Mukherjee, A.:“Cost Minimization for a Personal Communication Services Network Using Random-Walk Mobility Management Model”, International Conference on Systematic, Cybernetics and Informatics (SCI-2000), Orlando, Florida.
Goldberg, D. E.: “Genetic Algorithms, in Search, Optimization & Machine Learning”, PHI Fourth Indian Reprint, 2001.
R. K. Pradhan, “Some Aspects of Design of Location Area in Personal Communication Services Network”, Post Graduate Dissertation, 2002
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maitra, M., Pradhan, R.K., Saha, D., Mukherjee, A. (2002). Design of Optimal LA in Personal Communication Services Network Using Simulated Annealing Technique. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_88
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive