Abstract
Location tracking and establishing end-to-end connectivity is one of the biggest challenges in mobile computing and wireless communication environment. Thus, there is a need to develop algorithms that can be easily implemented and used to solve a wide range of complex location management problems. Location management cost includes search cost and update cost. We have used reporting cells location management scheme to solve the location management problem. It has been reported that optimal reporting cell configuration is an NP complete problem. In the reporting cell location management scheme, few cells in the network are designated as reporting cells; mobile terminals update their positions (location update) upon entering one of these reporting cells. Vicinity of a reporting cell is defined as the number of reachable cells, without going through any other reporting cell. The objective of this paper is to minimize the location management cost of the network through an optimum reporting cell configuration. The proposed approach is giving better performance for bigger networks compared to earlier schemes. We also show the change in the location management cost with respect to different calls per mobility values and network size.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Subrata, R., Zomaya, A.Y.: A Comparison of Three Artificial Life Techniques for Reporting Cell Planning in Mobile Computing. IEEE Transactions on Parallel and Distributed Systems 14(2), 142–153 (2003)
Mehta, F., Swadas, P.: A Simulated Annealing Approach to Reporting Cell Planning Problem of Mobile Location Management. International Journal of Recent Trends in Engineering 2(2), 98–102 (2009)
Karaoğlu, B., Topçuoğlu, H., Gürgen, F.: Evolutionary Algorithms for Location Area Management. In: Rothlauf, F., Branke, J., Cagnoni, S., Corne, D.W., Drechsler, R., Jin, Y., Machado, P., Marchiori, E., Romero, J., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2005. LNCS, vol. 3449, pp. 175–184. Springer, Heidelberg (2005)
Gondim, P.R.L.: Genetic Algorithms and the Location Area Partitioning Problem in Cellular Networks. In: Proc. IEEE 46th Vehicular Technology Conf., pp. 1835–1838 (1996)
Xie, H., Tabbane, S., Goodman, D.J.: Dynamic Location Area Management and Performance Analysis. In: Proc. 43rd IEEE Vehicular Technology Conf. Personal Comm. Freedom Through Wireless Technology, pp. 536–539 (1993)
Almeida-Luz, S.M., Vega-Rodrguez, M.A., Gmez-Plido, J.A., Snchez-Prez, J.M.: Differential evolution for solving the mobile location management. Applied Soft Computing 11, 410–427 (2011)
Golberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1994)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Moscato, P.A.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms, Tech. Rep. Caltech Concurrent Computation Program Report 826, Caltech (1989)
Taheri, J., Zomaya, A.Y.: Clustering techniques for dynamic mobility management. In: MobiWac 2006: Proceedings of the 4th ACM International Workshop on Mobility Management and Wireless Acceess, pp. 10–17. ACM (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patra, M., Udgata, S.K. (2011). Soft Computing Approach for Location Management Problem in Wireless Mobile Environment. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-27242-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27241-7
Online ISBN: 978-3-642-27242-4
eBook Packages: Computer ScienceComputer Science (R0)