Abstract
This chapter develops a series of optimization models for third-generation (3G) cellular network design leading up to a comprehensive model including the selection of base stations and mobile telephone switching office (MTSO) locations, and the assignment of mobiles to base stations. The models also consider the design of a backbone network connecting the base stations, MTSOs, and public switched telephone network (PSTN) gateways. These models take as input demand for cellular service in a given planning area, a set of candidate tower and MTSO locations with corresponding costs, costs for provisioning links between the candidate tower and MTSO locations as well as costs for linking the MTSOs to PSTN gateway nodes. Based on these inputs and propagation data for the planning area, the comprehensive model can be used to determine the optimal selection of radio towers, MTSO locations, backbone network topology, and the service capacity of the resulting radio network. For problem instances of practical interest, the model leads to large, difficult integer programs that require special solution techniques. Nevertheless, researchers have reported finding high-quality solutions, in reasonable amounts of CPU time, to problems with hundreds of candidate tower locations supporting tens of thousands of simultaneous cellular phone sessions. This chapter surveys strategies that have been developed to achieve these results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References(Ch-5)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ (1993)
Amaldi, E., Capone, A., Malucelli, F.: Base station configuration and location problems in UMTS networks. In: Proceedings of the 9th International Conference on Telecommunication Systems - Modeling and Analysis, pp. 341–348 (2001)
Amaldi, E., Capone, A., Malucelli, F.: Discrete models and algorithms for the capacitated location problems arising in UMTS network planning. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1–8. ACM (2001)
Amaldi, E., Capone, A., Malucelli, F.: Improved models and algorithms for UMTS radio planning. In: IEEE 54th Vehicular Technology Conference Proceedings, vol. 2, pp. 920–924. IEEE (2001)
Amaldi, E., Capone, A., Malucelli, F.: Optimizing base station siting in UMTS networks. In: IEEE 53rd Vehicular Technology Conference Proceedings, vol. 4, pp. 2828–2832. IEEE (2001)
Amaldi, E., Capone, A., Malucelli, F.: Optimization models and algorithms for downlink UMTS radio planning. In: Proceedings of the IEEE Wireless Communications and Networking Conference, vol. 2, pp. 827–8731. IEEE (2003)
Amaldi, E., Capone, A., Malucelli, F.: Planning UMTS base station location: Optimization models with power control algorithms. IEEE Transactions on Wireless Communications 2, 939–952 (2003)
Amaldi, E., Capone, A., Malucelli, F., Signori, F.: A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints. In: IEEE 58th Vehicular Technology Conference Proceedings, vol. 2, pp. 806–810. IEEE (2003)
Amzallag, D.: Approximation algorithms for optimization problems in future cellular networks. Ph.D. thesis, Technion - Israel Institute of Technology, Haifa 32000, Israel (2008)
Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming Series A 90, 263–272 (2001)
Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Mathematics of Operations Research 23, 769–805 (1998)
Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming Series A 88, 411–424 (2000)
Bienstock, D., D’Andreagiovanni, F.: Robust wireless network planning. In: Proceedings of the XL Annual Conference of the Italian Operational Research Society (AIRO2009), Siena, Italy (2009)
Birkan, G., Kennington, J., Olinick, E., Ortynski, A., Spiride, G.: Making a case for using integer programming to design DWDM networks. Optical Networks Magazine 4, 107–120 (2003)
Cai, Q.: Optimization-based design tools forW-CDMA cellular networks. Ph.D. thesis, Southern Methodist University (2006)
Cai, Q., Kalvenes, J., Kennington, J., Olinick, E.: Reliable W-CDMA network design. Tech. Rep., Department of Engineering Management, Information, and Systems, Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX (2006). http://lyle.smu.edu/ jlk/cdmarely.pdf
Cai, Q., Kalvenes, J., Kennington, J., Olinick, E.: W-CDMA network design. International Journal of Mobile Newtork Design and Innovation 2(2), 92–104 (2007)
D’Andreagiovanni, F.: Pure 0-1 programming approaches to wireless network design. Ph.D. thesis, Sapienza Università di Roma (2009)
D’Andreagiovanni, F., Mannino, C., Sassano, A.: A power-indexed formulation for wireless network design. Tech. Rep. 14-2009, Department of Computer and System Sciences, Sapienza Universit`a di Roma (2009). http://ojs.uniroma1.it/index.php/DIS TechnicalReports/article/viewFile/8855/8826
Eisenblätter, A., Fügenschuh, A., Fledderus, E.R., Geerdes, H.F., Heideck, B., Junglas, D., Koch, T., Kürner, T., Martin, A.: Mathematical methods for automatic optimization of UMTS radio networks. Tech. Rep. D4.3, IST-2000-28088 MOMENTUM (2003). URL http://momentum.zib.de/paper/momentum-d43.pdf
Eisenblätter, A., Fügenschuh, A., Koch, T., Koster, A.M.C.A., Martin, A., Pfender, T., Wegel, O., Wessäly, R.: Modelling feasible network configurations for UMTS. In: G. Anandalingam, S. Raghavan (eds.) Telecommunications Network Design and Managment, pp. 1–23. Kluwer Academic Publishers, Dordrecht, The Netherlands (2003)
Eswaran, K., Trajan, R.: Augmentation problems. SIAM Journal on Computing 5(4), 653–660 (1976)
FCC: Construction/coverage requirements. http://wireless.fcc.gov/licensing/index.htm?job=const req by service. Accessed on June 14, 2010
Fortz, B., Labbé, M., Maffioli, F.: Solving the two-connected network with bounded meshes problem. Operations Research 48, 866–877 (2000)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman, San Francisco, CA (1979)
Glover, F.: Tabu search, Part I. ORSA Journal on Computing 1(3), 190–206 (1989)
Glover, F.: Tabu search, Part II. ORSA Journal on Computing 2(1), 4–32 (1990)
Grötschel, M., Monma, C., Stoer, M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research 40, 309–330 (1992)
Grötschel, M., Monma, C., Stoer, M.: Design of survivable networks. In: Handbooks in OR/MS, vol. 8, chap. 10, pp. 617–672. North-Holland, Amsterdam, The Netherlands (1995)
Gryseels, M., Sorbello, L., Demeester, P.: Network planning in uncertain dynamic environments. In: Networks 2000, 9th International Telecommunication Network Planning Symposium (2000).
Hata, M.: Empirical formula for propagation loss in land mobile radio service. IEEE Transactions on Vehicular Technology 29, 317–325 (1980)
J. Blazewicz, P.L., Milostan, M.: Application of tabu search strategy for finding low energy structure of protien. Artificial Intelligence in Medicine 35, 135–145 (2005)
Kalvenes, J., Kennington, J., Olinick, E.: Hierarchical cellular network design with channel allocation. European Journal of Operational Research 160(1), 3–18 (2005).
Kalvenes, J., Kennington, J., Olinick, E.: Base station location and service assignments in W-CDMA networks. INFORMS Journal on Computing 18(3), 366–376 (2006)
Kennington, J., Lewis, K., Olinick, E., Ortynski, A., Spiride, G.: Robust solutions for the WDMrouting and provisioning problem: models and algorithms. Optical Networks Magazine 4, 74–84 (2003)
Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: D. Hochbaum (ed.) Approximation Algorithms for NP-Hard Problems, pp. 236–265. PWS Publishing Company, Boston, MA (1997)
Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands (1997)
Laguna, M.: Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Science 44, 5101–5110 (1998)
Lee, J., Miller, L.E.: CDMA Systems Engineering Handbook. Artech House Publisher, Boston, MA (1998)
Li, J., Kameda, H., Itoh, H.: Balanced assignment of cells in PCS networks. In: SAC’97: Proceedings of the 1997 ACM symposium on Applied computing, pp. 297–301. ACM, New York, NY, USA (1997).
Mannino, C., Mattia, S., Sassano, A.: Planning wireless networks by shortest path. Computational Optimization and Applications (2009). Published online at http://dx.doi.org/10.1007/s10589-009-9264-3
Mathar, R., Niessen, T.: Optimum positioning of base stations for cellular radio networks. Wireless Networks 6, 421–428 (2000)
Merchant, A., Sengupta, B.: Assignment of cells to switches in PCS networks. ACM/IEEE Transactions on Networking 3, 521–526 (1995)
Mobiledea: Mobile telephone switching office (MTSO). http://www.mobiledia.com/glossary/166.html. Accessed on June 14, 2010
Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Operations Research 43, 264–281 (1995)
Murphey, R., Pardalos, P., Resende, G.: Frequency assignment problems. In: D. Zu, P. Pardalos (eds.) Handbook of Combinatorial Optimization, pp. 1–55. Kluwer Academic Publishers (1999)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. JohnWiley & Sons, New York (1999)
Olinick, E., Rosenberger, J.: Optimizing revenue in CDMA networks under demand uncertainty. European Journal of Operational Research 186(2), 812 – 825 (2008).
Paraskevopoulos, D., Karakitsos, E., Rustem, R.: Robust capacity planning under uncertainty. Management Science 37, 787–800 (1991)
Philpott, A.: Stochastic programming introduction. http://stoprog.org/index.html?spintroduction.html. Accessed on June 21, 2010
Rajan, D., Olinick, E., Venkateswaran, J.: A unified optimization framework for design of CDMA cellular networks with uplink and downlink rate guarantees. Tech. Rep. 10-EMIS-04, Department of Engineering Management, Information, and Systems, Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX (2010)
Rosenberger, J., Olinick, E.: Robust tower location for code devision multiple access networks. Naval Research Logistics 54(2), 151–161 (2007)
Sherali, H.D., Pendyala, C.M., Rappaport, T.S.: Optimal location of transmitters for microcellular radio communication system design. IEEE Journal on Selected Areas in Communications 14(4), 662–673 (1996)
Soteriou, A., Chase, R.: A robust optimization approach to improving service quality. Manufacturing and Service Operations Management 2, 264–286 (2000)
St-Hilaire, M., Chamberland, S., Pierre, S.: Uplink UMTS network design–an integrated approach. Computer Networks 50, 2747–2761 (2006)
TopBits.com: MTSO mobile telephone switching office. http://www.topbits.com/mtsomobile-telephone-switching-office.html. Accessed on June 14, 2010
Yates, R.: A framework for uplink power control in cellular radio systems. IEEE Journal on Select Areas in Communications 13, 1341–1348 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer New York
About this chapter
Cite this chapter
Olinick, E. (2011). Mathematical Programming Models for Third Generation Wireless Network Design. In: Kennington, J., Olinick, E., Rajan, D. (eds) Wireless Network Design. International Series in Operations Research & Management Science, vol 158. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-6111-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6111-2_5
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-6110-5
Online ISBN: 978-1-4419-6111-2
eBook Packages: Business and EconomicsBusiness and Management (R0)