skip to main content
10.1145/381448.381449acmconferencesArticle/Chapter ViewAbstractPublication PagesdialmConference Proceedingsconference-collections
Article

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

Authors Info & Claims
Published:21 July 2001Publication History

ABSTRACT

In UMTS networks base station location cannot only be based on signal predictions, but it must also consider the traffic distribution, the power control mechanism as well as the power limits and the signal quality constraints. In this paper we discuss integer programming models and discrete algorithms aimed at supporting the decisions in the process of planning where to locate the new base stations. We consider the Signal-to-Interference Ratio (SIR) as quality measure and two power control mechanisms which keep the received signal power or the estimated SIR at a given target value. The focus is on the uplink (mobile to base station) direction which turns out to be the most stringent one in the presence of full-duplex balanced connections such as voice calls. To find good approximate solutions of these NP-hard problems which are extensions of standard capacitated location problems, we present randomized greedy and reverse greedy procedures as well as a randomized method combining the types of steps used in the two above procedures. Computational results are reported for small to large size realistic uplink instances generated using classical propagation models.

References

  1. 1.E. Amaldi, A. Capone, and F. Malucelli. Base station configuration and location problems in UMTS networks. In Proceedings of the 9th International Conference on Telecommunication Systems, Modeling and Analysis, pages 341-348, 2001.Google ScholarGoogle Scholar
  2. 2.A. Capone and M. Trubian. Channel assignment problem in cellular systems: a new model and tabu search algorithm. IEEE Trans. on Vehicular Technology, 48:1252-1260, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3.T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2):109-133, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4.M. Gallagher and W. Webb. UMTS the next generation of mobile radio. IEE Review, 45(2):59-63, March 1999.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.M. Galota, C. Glasser, S. Reith, and H. Vollmer. A polynomial-time approximation scheme for base station positioning in UMTS networks. Technical report, Universitit Wiirzburg, 2000.Google ScholarGoogle Scholar
  6. 6.W. K. Hale. Frequency: Theory and applications. Proceedings of IEEE, 30:1497-1514, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.Q. Hao, B.-H. Soong, E. Gunawan, J.-T. Ong, C.-B. Soh, and Z. Li. A low-cost cellular mobile communication system: a hierarchical optimization network resource planning approach. IEEE Journal on Selected Areas in Communications, 15:1315-1326, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.M. Hata. Empirical formula for propagation loss in land mobile radio service. IEEE Trans. on Vehicular Technology, 29:317-325, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  9. 9.M. Labbbe and F. V. Louveaux. Location problems. In M. Dell'Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, chapter 16. John Wiley, 1997.Google ScholarGoogle Scholar
  10. 10.R. Mathar and T. Niessen. Optimum positioning of base stations for cellular radio networks. Wireless Networks, pages 421-428, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.M. Naghshineh and I. Katzela. Channel assignment schemes for cellular mobile telecommunications systems: A comprehensive survey. IEEE Personal Communications, 3 (3):10-31, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.D. Parsons. The mobile radio propagation channel. Wiley and Sons, West Sussex, 1996.Google ScholarGoogle Scholar
  13. 13.M. PiSro. Solving multicommodity integral flow problem by simulated allocation. Telecommunication Systems, 7:17-28, 1997.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.P. Reininger, S. Iksal, A. Caminada, and J. Korczak. Multi-stage optimization for mobile radio network planning. In Proceedings of the IEEE VTC 99, pages 2034-2038, 1999.Google ScholarGoogle Scholar
  15. 15.K. Richardson. UMTS overview. Electronics & Communication Engineering Journal, 12(3):93-100, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  16. 16.A. Samukic. UMTS universal mobile telecommunications system: development of standards for the third generation. IEEE Transactions on Vehicular Technology, 47(4):1099-1104, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  17. 17.K. Tutschku. Demand-based radio network planning of cellular mobile communication systems. In Proceedings of the IEEE INFOCOM'98, volume 3, pages 1054-1061, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  18. 18.K. Tutschku. Interference minimization using automatic design of cellular communication networks. In Proceedings of the VTC'98, volume 1, pages 634-638, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  19. 19.R. D. Yates. A framework for uplink power control in cellular radio systems. IEEE Journal on Selected Areas in Communications, 13:1341-1347, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.J. Zimmermann, R. HSns, and H. Miihlenbein. The antenna placement problem for mobile radio networks: an evolutionary approach. In Proceedings of the 8th Int. Conference on Telecommunication Systems, pages 358-366, 2000.Google ScholarGoogle Scholar

Index Terms

  1. Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  DIALM '01: Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
                  July 2001
                  94 pages
                  ISBN:1581134215
                  DOI:10.1145/381448

                  Copyright © 2001 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 21 July 2001

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate21of68submissions,31%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader