Skip to main content
SpringerLink
Log in

Wireless Communication Is in APX

  • Conference paper
Automata, Languages and Programming (ICALP 2009)

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

Included in the following conference series:

Abstract

In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem is known as the wireless scheduling problem. Our main result proves that wireless scheduling is in APX. In addition we present a robustness result, showing that constant parameter and model changes will modify the result only by a constant.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Auletta, V., Moscardelli, L., Penna, P., Persiano, G.: Interference games in wireless networks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 278–285. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SNR diagrams: Towards algorithmically usable SINR models of wireless networks. arXiv:0811.3284v2 (2008)

    Google Scholar 

  3. Brar, G., Blough, D., Santi, P.: Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks. In: Mobicom (2006)

    Google Scholar 

  4. Brar, G.S., Blough, D.M., Santi, P.: The scream approach for efficient distributed scheduling with physical interference in wireless mesh networks. In: ICDCS, pp. 214–224 (2008)

    Google Scholar 

  5. Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Cross-layer Latency Minimization for Wireless Networks using SINR Constraints. In: Mobihoc (2007)

    Google Scholar 

  6. Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. In: Infocom (2008)

    Google Scholar 

  7. ElBatt, T.A., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communications 3(1), 74–85 (2004)

    Article  Google Scholar 

  8. Gao, Y., Hou, J.C., Nguyen, H.: Topology control for maintaining network connectivity and maximizing network capacity under the physical model. In: Infocom (2008)

    Google Scholar 

  9. Goussevskaia, O., Halldórsson, M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: 28th Annual IEEE Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil (April 2009)

    Google Scholar 

  10. Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local Broadcasting in the Physical Interference Model. In: ACM SIGACT-SIGOPT International Workshop on Foundations of Mobile Computing (DialM-POMC), Toronto, Canada (August 2008)

    Google Scholar 

  11. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: Mobihoc (2007)

    Google Scholar 

  12. Goussevskaia, O., Wattenhofer, R.: Complexity of scheduling with analog network coding. In: FOWANC (2008)

    Google Scholar 

  13. Gronkvist, J., Hansson, A.: Comparison between graph-based and interference-based STDMA scheduling. In: Mobihoc (2001)

    Google Scholar 

  14. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. Information Theory (2000)

    Google Scholar 

  15. Hua, Q.-S., Lau, F.C.M.: The scheduling and energy complexity of strong connectivity in ultra-wideband networks. In: MSWiM, pp. 282–290 (2006)

    Google Scholar 

  16. Hua, Q.-S., Lau, F.C.M.: Exact and approximate link scheduling algorithms under the physical interference model. In: DIALM-POMC, pp. 45–54 (2008)

    Google Scholar 

  17. Katz, B., Völker, M., Wagner, D.: Link scheduling in local interference models. In: Fekete, S.P. (ed.) ALGOSENSORS 2008. LNCS, vol. 5389, pp. 57–71. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Algorithmic Aspects of Capacity in Wireless Networks. In: Sigmetrics (2005)

    Google Scholar 

  19. Maheshwari, R., Jain, S., Das, S.R.: A measurement study of interference modeling and scheduling in low-power wireless networks. In: SenSys, pp. 141–154 (2008)

    Google Scholar 

  20. Moscibroda, T.: The worst-case capacity of wireless sensor networks. In: IPSN (2007)

    Google Scholar 

  21. Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: INFOCOM, pp. 1433–1441 (2007)

    Google Scholar 

  22. Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Infocom (2006)

    Google Scholar 

  23. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Hotnets (November 2006)

    Google Scholar 

  24. Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: Mobihoc (2006)

    Google Scholar 

  25. Scheideler, C., Richa, A.W., Santi, P.: An o(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: MobiHoc, pp. 91–100 (2008)

    Google Scholar 

  26. Zussman, G., Brzezinski, A., Modiano, E.: Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks. In: Infocom (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Reykjavik University, 103, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland

    Roger Wattenhofer

Authors
  1. Magnús M. Halldórsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roger Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer and Systems Sciences, Sapienza University of Rome, Via Ariosto 25, 00184, Roma, Italy

    Alberto Marchetti-Spaccamela

  3. Google R&D Center, School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yossi Matias

  4. University of Patras and CTI, N. Kazantzaki Street 1, 26504 Rion, Patras, Greece

    Sotiris Nikoletseas

  5. RWTH Aachen, Lehrstuhl Informatik 7, Ahornstraße 55, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halldórsson, M.M., Wattenhofer, R. (2009). Wireless Communication Is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02927-1_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02927-1_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02926-4

  • Online ISBN: 978-3-642-02927-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation