Skip to main content
SpringerLink
Log in

Distributed Approximation of Cellular Coverage

  • Conference paper
Principles of Distributed Systems (OPODIS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5401))

Included in the following conference series:

Abstract

We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered by a specific subset of the base stations, and its profit is obtained only if its demand is provided in full. The goal is to assign clients to base stations, so that the overall profit is maximized subject to base station capacity constraints.

In this work we present a distributed algorithm for the problem, that runs in polylogarithmic time, and guarantees an approximation ratio close to the best known ratio achievable by a centralized algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amzallag, D., Bar-Yehuda, R., Raz, D., Scalosub, G.: Cell selection in 4G cellular networks. In: Proceedings of IEEE INFOCOM 2008, The 27th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 700–708 (2008)

    Google Scholar 

  2. Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)

    Google Scholar 

  3. Israeli, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters 22(2), 77–80 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hanly, S.V.: 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 

  5. Mathar, R., Schmeink, M.: Integrated optimal cell site selection and frequency allocation for cellular radio networks. Telecommunication Systems 21, 339–347 (2002)

    Article  Google Scholar 

  6. Sang, A., Wang, X., Madihian, M., Gitlin, R.D.: 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), pp. 302–314 (2004)

    Google Scholar 

  7. Amzallag, D., Naor, J., Raz, D.: Coping with interference: From maximum coverage to planning cellular networks. In: Proceedings of the 4th Workshop on Approximation and Online Algorithms (WAOA), pp. 29–42 (2006)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62, 461–474 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 213–222 (2000)

    Google Scholar 

  11. Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Information Processing Letters 100(4), 162–166 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. In: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 129–136 (2008)

    Google Scholar 

  13. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)

    MathSciNet  MATH  Google Scholar 

  14. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Shieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM 48(5), 1069–1090 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Tel Aviv University, Tel Aviv, 69978, Israel

    Boaz Patt-Shamir & Dror Rawitz

  2. Department of Computer Science, University of Toronto, Toronto, ON, Canada

    Gabriel Scalosub

Authors
  1. Boaz Patt-Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dror Rawitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gabriel Scalosub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Florida State University, 207A Love Building, PO Box 4530, FL 32306-4530, Tallahassee, USA

    Theodore P. Baker

  2. Université de Versailles-St-Quentin-en-Yvelines, 45, avenue des Etats-Unis, 78035, Versailles Cedex, France

    Alain Bui

  3. LIP6 & INRIA Grand Large, Université Pierre et Marie Curie - Paris 6, 104 avenue du Président Kennedy, 75016, Paris, France

    Sébastien Tixeuil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patt-Shamir, B., Rawitz, D., Scalosub, G. (2008). Distributed Approximation of Cellular Coverage. In: Baker, T.P., Bui, A., Tixeuil, S. (eds) Principles of Distributed Systems. OPODIS 2008. Lecture Notes in Computer Science, vol 5401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92221-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92221-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92220-9

  • Online ISBN: 978-3-540-92221-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation