Skip to main content
SpringerLink
Log in

Resource Allocation Algorithms for the Next Generation Cellular Networks

  • Chapter
  • First Online:
Algorithms for Next Generation Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

This chapter describes recent results addressing resource allocation problems in the context of current and future cellular technologies. We present models that capture several fundamental aspects of planning and operating these networks, and develop new approximation algorithms providing provable good solutions for the corresponding optimization problems. We mainly focus on two families of problems: cell planning and cell selection. Cell planning deals with choosing a network of base stations that can provide the required coverage of the service area with respect to the traffic requirements, available capacities, interference, and the desired QoS. Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the utilization of current and future cellular networks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Notes

  1. 1.

    We assume that the reader is familiar with the most well-known notions in cellular networks. An excellent introduction can be found in [36]

  2. 2.

    Notice that when planning cellular networks, the notion of “clients” sometimes means mobile stations and sometimes it represents the total traffic demand created by a cluster of mobile stations at a given location. In this chapter we support both forms of representations.

  3. 3.

    For simplicity, we do not consider here interference of higher order. These can be further derived and extended from our model.

  4. 4.

    The class ZPP is equal to the intersection of the computational complexity classes RP and Co-RP

References

  1. A. Ageev and M. Sviridenko. Approximation algorithms for maximum coverage and max cut with given sizes of parts. In Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 1610 of Lecture Notes in Computer Science, pages 17–30. Springer-Verlag, 1999.

    Google Scholar 

  2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows (Theory, Algorithms, and Applications). Prentice Hall, 1993.

    Google Scholar 

  3. D. Amzallag, R. Bar-Yehuda, D. Raz, and G. Scalosub. Cell Selection in 4G Cellular Networks. In Proceedings of the Annual IEEE 27th INFOCOM, pages 700–708, 2008.

    Google Scholar 

  4. D. Amzallag, R. Engelberg, J. Naor, and D. Raz. Cell planning of 4G cellular networks. Technical Report CS-2008-04, Computer Science Department, Technion - Israel Institute of Technology, 2008.

    Google Scholar 

  5. D. Amzallag, M. Livschitz, J. Naor, and D. Raz. Cell planning of 4G cellular networks: Algorithmic techniques, and results. In Proceedings of the 6th IEE International Conference on 3G & Beyond (3G’2005), pages 501–506, 2005.

    Google Scholar 

  6. D. Amzallag, J. Naor, and D. Raz. Coping with interference: From maximum coverage to planning cellular networks. In Proceedings of the 4th Workshop on Approximation and Online Algorithms (WAOA), volume 4368 of Lecture Notes in Computer Science. Springer-Verlag, 2006.

    Google Scholar 

  7. D. Amzallag, J. Naor, and D. Raz. Algorithmic aspects of radio access network design in B3G/4G cellular networks. In Proceedings of the Annual IEEE 26th INFOCOM, pages 991–999, 2007.

    Google Scholar 

  8. David Amzallag. Approximation Algorithms for Optimization Problems in Future Cellular Networks. PhD thesis, Department of Computer Science, Technion - Israel Institute of Technology, 2008.

    Google Scholar 

  9. M. Andrews and L. Zhang. Hardness of the undirected edge-disjoint path problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 276–283, 2005.

    Google Scholar 

  10. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the 32th ACM Symposium on Theory of Computing (STOC), pages 735–744, 2000.

    Google Scholar 

  11. R. Bar-Yehuda. One for the price of two: A unified approach for approximating covering problems. Algorithmica, 27(2):131–144, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. F. Cátedra and J. Pérez-Arriaga, editors. Cell Planning for Wireless Communications. Mobile Communications Series. Atrech House Publishers, Norwood, MA, 1999.

    Google Scholar 

  13. C. Chekuri, S. Khanna, and F. B. Shepherd. The all-or-nothing multicommodity flow problem. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 156–165, 2004.

    Google Scholar 

  14. C. Chekuri, S. Khanna, and F. B. Shepherd. Multicommodity flow, well-linked terminals, and routing problems. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 183–192, 2005.

    Google Scholar 

  15. J. Chuzhoy and J. Naor. Covering problems with hard capacities. In Proceedings of the 43th Annual IEEE Symposium on Foundations on Computer Science (FOCS), pages 481–489, 2002.

    Google Scholar 

  16. M. Dawande, J. Kalagnanam, P. Keskinocak, F.S. Salman, and R. Ravi. Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization, 4(2):171–186, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  17. E. D. Demaine, U. Feige, M. Hajiaghayi, and M. R. Salavatipour. Combination can be hard: Approximability of the unique coverage problem. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 162–171, 2006.

    Google Scholar 

  18. U. Feige. A threshold of lnn for approximating set cover. J. ACM, 45:634–652, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  19. U. Feige. Coping with NP-hardness of the graph bandwidth problem. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT), pages 10–19, 2000.

    Google Scholar 

  20. L. Fleischer, M.X. Goemans, V.S. Mirrokni, and M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 611–620, 2006.

    Google Scholar 

  21. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.

    MATH  Google Scholar 

  22. S. V. Hanly. An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity. IEEE Journal on Selected Areas in Communications, 13(7):1332–1340, 1995.

    Article  Google Scholar 

  23. S. Y. Hui and K. H. Yeung. Challenges in the migration to 4G mobile systems. IEEE Communications Magazine, 41:54–59, December 2003.

    Article  Google Scholar 

  24. N. Johnston and H. Aghvami. Comparing WiMAX and HSPA: A guide to the technology. BT Technology Journal (BTTJ), 25(2):191–199, 2007.

    Article  Google Scholar 

  25. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70:39–45, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  26. Y. K. Kim and R. Prasad. 4G Roadmap and Emerging Communication Technologies. Artech House Publishers, Boston, MA, 2006.

    Google Scholar 

  27. R. Mathar and M. Schmeink. Optimal base station positioning and channel assignment for 3G mobile networks by integer programming. Annals of Operations Research, 107:225–236, 2002.

    Article  MathSciNet  Google Scholar 

  28. M. J. Nawrocki, M. Dohler, and A. Hamid Aghvami, editors. Understanding UMTS Radio Network: Modelling, Planning and Automated Optimisation. John Wiley & Sons, Ltd., 2006.

    Google Scholar 

  29. B. Patt-Shamir, D. Rawitz, and G. Scalosub. Distributed approximation of cellular coverage. In Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS), pp. 331–345, 2008.

    Google Scholar 

  30. A. Sang, X. Wang, M. Madihian, and R. D. Gitlin. A Load-aware handoff and cell-site selection scheme in multi-cell packet data systems. In Proceedings of the IEEE 47th Global Telecommunications Conference (GLOBECOM), volume 6, pages 3931–3936, 2004.

    Google Scholar 

  31. A. Sang, X. Wang, M. Madihian, and R. D. Gitlin. Coordinated load balancing, handoff/ cell-site selection, and scheduling in multi-cell packet data systems. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pages 302–314, 2004.

    Google Scholar 

  32. M. Sviridenko. A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters, 32:41–43, 2004.

    Article  MathSciNet  MATH  Google Scholar 

  33. K. Tutschku. Demand-based radio network planning of cellular mobile communication systems. In Proceedings of the IEEE 17th INFOCOM, pages 1054–1061, 1998.

    Google Scholar 

  34. N. Umeda, T. Otsu, and T. Masamura. Overview of the fourth-generation mobile communication system. NTT DoCoMo Technical Review, 2(9):12–31, 2004. Available at http://www.ntt.co.jp/tr/0409/special.html.

  35. J. Vygen. Approximation algorithms for facility location problems. Technical report 05950-OR, Research Institute for Discrete Mathematics, University of Bonn, 2005. Available at http://www.or.uni-bonn.de/~vygen/fl.pdf.

  36. D. Wisely. Cellular mobile–the generation game. BT Technology Journal (BTTJ), 25(2):27–41, 2007.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. British Telecommunications plc, 81 Newgate Street, London, EC1A 7AJ, UK

    David Amzallag

  2. Computer Science Department, Technion – Israel Institute of Technology, Haifa, 32000, Israel

    Danny Raz

Authors
  1. David Amzallag
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny Raz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Amzallag .

Editor information

Editors and Affiliations

  1. AT & T Labs Research, Park Ave. 180, Florham Park, 07932, U.S.A.

    Graham Cormode

  2. Networking Research Lab., Bell Labs, Mountain Ave. 600-700, Murray Hill, 07974, U.S.A.

    Marina Thottan

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Amzallag, D., Raz, D. (2010). Resource Allocation Algorithms for the Next Generation Cellular Networks. In: Cormode, G., Thottan, M. (eds) Algorithms for Next Generation Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-765-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-765-3_6

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-764-6

  • Online ISBN: 978-1-84882-765-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation