Skip to main content

Solving the Location Areas Scheme in Realistic Networks by Using a Multi-objective Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7835))

Abstract

The optimization of the management tasks in current mobile networks is an interesting research field due to the exponential increase in the number of mobile subscribers. In this paper, we study two of the most important management tasks of the Public Land Mobile Networks: the location update and the paging, since these two procedures are used by the mobile network to locate and track the Mobile Stations. There are several strategies to manage the location update and the paging, but we focus on the Location Areas scheme with a two-cycle sequential paging, a strategy widely applied in current mobile networks. This scheme can be formulated as a multi-objective optimization problem with two objective functions: minimize the number of location updates and minimize the number of paging messages. In previous works, this multi-objective problem was solved with single-objective optimization algorithms by means of the linear aggregation of the objective functions. In order to avoid the drawbacks related to the linear aggregation, we propose an adaptation of the Non-dominated Sorting Genetic Algorithm II to solve the Location Areas Planning Problem. Furthermore, with the aim of studying a realistic mobile network, we apply our algorithm to a scenario located in the San Francisco Bay (USA). Results show that our algorithm outperforms the algorithms proposed by other authors, as well as the advantages of a multi-objective approach.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, D.P., Zeng, Q.A.: Introduction to Wireless and Mobile Systems, 3rd edn. Cengage Learning, Stamdford (2010)

    Google Scholar 

  2. Garg, V.: Wireless Communications and Networking, 1st edn. Elsevier, San Francisco (2007)

    Google Scholar 

  3. Tabbane, S.: Location management methods for third-generation mobile systems. IEEE Commun. Mag. 35(8), 72–84 (1997)

    Article  Google Scholar 

  4. Wong, V.W.-S., Leung, V.C.M.: Location management for next generation personal communications networks. IEEE Network 14(5), 18–24 (2000)

    Article  Google Scholar 

  5. Kyamakya, K., Jobmann, K.: Location management in cellular networks: classification of the most important paradigms, realistic simulation framework, and relative performance analysis. IEEE Transactions on Vehicular Technology 54(2), 687–708 (2005)

    Article  Google Scholar 

  6. Gondim, P.: Genetic algorithms and the location area partitioning problem in cellular networks. In: Proceedings of IEEE 46th Vehicular Technology Conference on Mobile Technology for the Human Race, vol. 3, pp. 1835–1838 (1996)

    Google Scholar 

  7. Demestichas, P., Georgantas, N., Tzifa, E., Demesticha, V., Striki, M., Kilanioti, M., Theologou, M.: Computationally efficient algorithms for location area planning in future cellular systems. Computer Communications 23(13), 1263–1280 (2000)

    Article  Google Scholar 

  8. Taheri, J., Zomaya, A.: The use of a Hopfield neural network in solving the mobility management problem. In: Proceedings of The IEEE/ACS International Conference on Pervasive Services, pp. 141–150. IEEE Computer Society, Washington (2004)

    Chapter  Google Scholar 

  9. Taheri, J., Zomaya, A.: A genetic algorithm for finding optimal location area configurations for mobility management. In: Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary, pp. 568–577. IEEE Computer Society, Washington (2005)

    Google Scholar 

  10. Taheri, J., Zomaya, A.: A Simulated Annealing approach for mobile location management. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, pp. 194–201. IEEE Computer Society, Washington (2005)

    Chapter  Google Scholar 

  11. Taheri, J., Zomaya, A.: A combined genetic-neural algorithm for mobility management. Journal of Mathematical Modeling and Algorithms 6(3), 481–507 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Subrata, R., Zomaya, A.Y.: Dynamic Location Area Scheme for Location Management. Telecommunication Systems 22(1-4), 169–187 (2003)

    Article  Google Scholar 

  13. Stanford University Mobile Activity TRAces (SUMATRA), http://infolab.stanford.edu/sumatra (accessed in 2012)

  14. Almeida-Luz, S.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez-Pérez, J.M.: Differential evolution for solving the mobile location management. Applied Soft Computing 11(1), 410–427 (2011)

    Article  Google Scholar 

  15. Almeida-Luz, S.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez-Pérez, J.M.: Applying Differential Evolution to a Realistic Location Area Problem Using SUMATRA. In: Proceedings of The Second International Conference on Advanced Engineering Computing and Applications in Sciences, pp. 170–175. IEEE Computer Society, Washington (2008)

    Google Scholar 

  16. Almeida-Luz, S.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez-Pérez, J.M.: Applying Scatter Search to the Location Areas Problem. In: Corchado, E., Yin, H. (eds.) IDEAL 2009. LNCS, vol. 5788, pp. 791–798. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Almeida-Luz, S.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez-Pérez, J.M.: Solving a Realistic Location Area Problem Using SUMATRA Networks with the Scatter Search Algorithm. In: Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, pp. 689–694. IEEE Computer Society, Washington (2009)

    Google Scholar 

  18. Knowles, J., Thiele, L., Zitzler, E.: A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. Technical report 214, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland (2006)

    Google Scholar 

  19. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  20. Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation 2(3), 221–248 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berrocal-Plaza, V., Vega-Rodríguez, M.A., Sánchez-Pérez, J.M., Gómez-Pulido, J.A. (2013). Solving the Location Areas Scheme in Realistic Networks by Using a Multi-objective Algorithm. In: Esparcia-Alcázar, A.I. (eds) Applications of Evolutionary Computation. EvoApplications 2013. Lecture Notes in Computer Science, vol 7835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37192-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37192-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37191-2

  • Online ISBN: 978-3-642-37192-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics