Skip to main content

A Dynamic Genetic Algorithm Approach to the Problem of UMTS Network Assignment

  • Conference paper
  • First Online:
Networked Systems (NETYS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10299))

Included in the following conference series:

Abstract

The problem of the universal mobile telecommunication system (UMTS) network assignment is divided into two assignment sub-problems: the assignment of a set of Nodes Bs to a set of radio network controllers (RNCs), and the assignment of those RNC concurrently to a set of Mobile Switching Centers (MSCs) and a set of Serving GPRS Support Nodes (SGSNs). The objective is to find an assignment that minimizes the cost of such implementation.

This paper proposes, first, an improvement of the existing mathematical modelling. Second, it presents a solution method to the problem based on genetic algorithms with a dynamic approach. To compare our proposed model to the existing one, some numerical examples are given. The obtained results show the efficiency of our model and our approach.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Diallo, M.M., Pierre, S., Beaubrun, R.: A tabu search approach for assigning node Bs to switches in UMTS networks. IEEE Trans. Wirel. Commun. 9(4), 1350–1359 (2010)

    Article  Google Scholar 

  2. Kumar, R., Parida, P.P, Gupta, M.: Topological design of communication networks using multiobjective genetic optimization. In: Proceedings of the 2002 World Congress on Computational Intelligence, WCCI 2002, 12–17 May, Honolulu, HI, USA. IEEE (2002)

    Google Scholar 

  3. Juttner, A., Orban, A., Fiala, Z.: Two new algorithms for UMTS access network topology design. Eur. J. Oper. Res. 164, 456–474 (2005)

    Article  MATH  Google Scholar 

  4. Hashemi, S.M., Moradi, A., Rezapour, M.: An ACO algorithm to design UMTS access network using divided and conquer technique. Eng. Appl. Artif. Intell. 21, 931–940 (2008)

    Article  Google Scholar 

  5. Amaldi, E., Capone, A., Malucelli, F.: Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans. Wirel. Commun. 2, 939–952 (2003)

    Article  Google Scholar 

  6. St-Hilaire, M., Chamberland, S., Pierre, S.: Uplink UMTS network design-an integrated approach. Comput. Netw. 50, 2747–2761 (2006)

    Article  MATH  Google Scholar 

  7. Gabli, M., Jaara, E.M., Mermri, E.B.: Planning UMTS base station location using genetic algorithm with a dynamic trade-off parameter. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 120–134. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40148-0_9

    Chapter  Google Scholar 

  8. Gabli, M., Jaara, E.M., Mermri, E.B.: UMTS base-station location problem for uplink direction using genetic algorithms and fuzzy logic. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 257–269. Springer, Cham (2014). doi:10.1007/978-3-319-09581-3_18

    Google Scholar 

  9. Gabli, M., Jaara, E.M., Mermri, E.B.: A possibilistic approach to UMTS base-station location problem. Soft. Comput. 20(7), 2565–2575 (2016)

    Article  Google Scholar 

  10. Gabli, M., Jaara, E.M., Mermri, E.B.: A genetic algorithm approach for an equitable treatment of objective functions in multi-objective optimization problems. IAENG Int. J. Comput. Sci. 41(2), 102–111 (2014)

    Google Scholar 

  11. Merchant, A., Sengupta, B.: Assignment of cells to switches in PCS networks. IEEE-ACM Trans. Netw. 3(5), 521–526 (1995)

    Article  Google Scholar 

  12. Holland, J.: Outline for a logical theory of adaptive systems. J. Assoc. Comput. Mach. 9(3), 297–314 (1962)

    Article  MATH  Google Scholar 

  13. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Boston (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammed Gabli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gabli, M., Dahmani, S., Mermri, E.B., Serghini, A. (2017). A Dynamic Genetic Algorithm Approach to the Problem of UMTS Network Assignment. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59647-1_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59646-4

  • Online ISBN: 978-3-319-59647-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics