Skip to main content

Scalability Analysis of a Model for GSM Mobile Network Design

  • Conference paper
  • First Online:
Book cover Novel Algorithms and Techniques in Telecommunications and Networking

Abstract

This work shows a scalability analysis of the mathematical model and computational tool to design a GSM (Global System for Mobile Communications) Network, in the point of view of BSC (Base Station Controllers) allocation and dimensioning. It optimizes the total transmission cost and BSC acquisition cost. It determines how much BSC are need, in what sites they has to be allocated, what model each one must have to support the total traffic demand without wasting money with their acquisition and what BTS (Base Transceiver Station) must be linked to what BSC for transmission cost reduction. Its core is a integer programming (IP) model as presented in Wolsey et al [8]. Other important contribution in this model is the fact that it addresses the new resources allocation technique of BSC switches that rises its capacity. The traditional way of resources allocation (processors, for instance) to the radio channels was deterministic and fixed. Thus, its capacity was given by total number of voice channels (4096, for instance). Nowadays, the BSC can handle a pool of resources that are allocated on-demand. The capacity rises and is given by its total traffic in Erlang.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographical References

  1. Kubat, P e Smith, J. MacGregor. “A multi-period network design problem for cellular telecommunication systems”. European Journal of Operational Research, 134:439–456, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  2. Kubat, P., Smith, J. MacGregor e Yum. C. “Design of celullar networks with diversity and capacity constraints”. IEEE Transactions on Reability, 49:165–175, 2000.

    Article  Google Scholar 

  3. Rigolon, A. A., Pinheiro, P. R., Macambira, E. M., Ferreira, L. O. R. A. Approximate Algorithms in Mobile Telephone Network Projects. International Conference on Telecommunications and Networking, Bridgeport, Springer Verlag, 2005, v. XV, p. 234–347

    Google Scholar 

  4. Rodrigues, S. I. M. Relaxação Lagrangeana e subgradientes com dilatação de espaço aplicados a um problema de grande porte. RJ, 1993.

    Google Scholar 

  5. Shor, N. Z. Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics, 1:7–15, 1970.

    Google Scholar 

  6. Shor, N. Z. Zhurbenko, N. G. A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients. Cybernetics, 7(3):450–459, 1970.

    Article  Google Scholar 

  7. Wolsey, L. A. Integer programming. John Wiley & Sons, 1998.

    Google Scholar 

  8. ILOG. ILOG CPLEX 10.0 User’s Manual, January 2006.

    Google Scholar 

  9. Shrage, L., Optimization Modeling with Lingo. Lindo Systems Inc., 1998.

    Google Scholar 

  10. N. V. Nepomuceno, P. R. Pinheiro, A. L. V. Coelho. Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms. Lecture Notes in Computer Science, v. 4446, p. 154–165, 2007.

    Google Scholar 

  11. N. V. Nepomuceno, P. R. Pinheiro, A. L. V. Coelho. A Hybrid Optimization Framework for Cutting and Packing Problems: Case Study on Constrained 2D Non-guillotine Cutting. In: C. Cotta and J. van Hemert. (Org.). Recent Advances in Evolutionary Computation for Combinatorial Optimization. Berlin / Heidelberg: Springer-Verlag, 2008, v. 153, p. 87–99.

    Google Scholar 

  12. A. B. de Aguiar and P. R. Pinheiro. A Model for GSM Mobile Network Design, chapter Innovative Algorithms and Techniques in Automation, Industrial Eletronics and Telecomunications, pages 365–368. Springer Netherlands, Dordrecht, September 2007.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Pinheiro, R.F., de Aguiar, A.B., Pinheiro, P.R., de Neto, Á.M.S., Cunha, R.P.P., Neto, D. (2010). Scalability Analysis of a Model for GSM Mobile Network Design. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_80

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3662-9_80

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3661-2

  • Online ISBN: 978-90-481-3662-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics