Skip to main content

Limitations of Current Wireless Scheduling Algorithms

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9536))

  • 540 Accesses

Abstract

We consider the problem of scheduling wireless links in the physical model, where we seek a partition of a given a set of wireless links into the minimum number of subsets satisfying the signal-to-interference-and-noise-ratio (SINR) constraints. We consider the two families of approximation algorithms that are known to guarantee \(O(\log {n})\) approximation for the scheduling problem, where n is the number of links. We present network constructions showing that the approximation ratios of those algorithms are no better than logarithmic, both in n and in \(\varDelta \), where \(\varDelta \) is a geometric parameter – the ratio of the maximum and minimum link lengths.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 EPUB and 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

Similar content being viewed by others

References

  1. Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR diagrams: convexity and its applications in wireless networks. J. ACM 59(4), 18 (2012)

    Article  MathSciNet  Google Scholar 

  2. Belke, L., Kesselheim, T., Koster, A.M.C.A., Vöcking, B.: Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. In: Bar-Noy, A., Halldórsson, M.M. (eds.) ALGOSENSORS 2012. LNCS, vol. 7718, pp. 30–41. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Bodlaender, M., Halldórsson, M.M.: Beyond geometry: towards fully realistic wireless models. In: PODC (2014)

    Google Scholar 

  4. Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2–3), 152–160 (2007)

    Article  MATH  MathSciNet  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. Cruz, R.L., Santhanam, A.: Optimal routing, link scheduling, and power control in multi-hop wireless networks. In: INFOCOM (2003)

    Google Scholar 

  7. Dams, J., Hoefer, M., Kesselheim, T.: Scheduling in wireless networks with Rayleigh-fading interference. In: SPAA (2012)

    Google Scholar 

  8. Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the ad hoc SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 358–372. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Dinitz, M.: Distributed algorithms for approximating wireless network capacity. In: INFOCOM (2010)

    Google Scholar 

  10. ElBatt, T., Ephremides, A.: Joint scheduling and power control for wireless ad-hoc networks. In: INFOCOM (2002)

    Google Scholar 

  11. Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: PODC, August 2009

    Google Scholar 

  12. Fu, L., Liew, S.C., Huang, J.: Power controlled scheduling with consecutive transmission constraints: complexity analysis and algorithm design. In: INFOCOM. IEEE (2009)

    Google Scholar 

  13. Goussevskaia, O., Halldórsson, M.M., Wattenhofer, R.: Algorithms for wireless capacity. IEEE/ACM Trans. Netw. 22(3), 745–755 (2014)

    Article  Google Scholar 

  14. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: MobiHoc (2007)

    Google Scholar 

  15. Gudmundsdottir, H., Ásgeirsson, E.I., Bodlaender, M., Foley, J.T., Halldórsson, M.M., Vigfusson, Y.: Measurement based interference models for wireless scheduling algorithms. In: MSWiM (2014)

    Google Scholar 

  16. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theor. 46(2), 388–404 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. J. Graph Theor. 12(2), 217–227 (1988)

    Article  MATH  Google Scholar 

  18. Halldórsson, M.M.: Wireless scheduling with power control. ACM Trans. Algorithms 9(1), 7 (2012)

    Article  MathSciNet  Google Scholar 

  19. Halldórsson, M.M., Holzer, S., Mitra, P., Wattenhofer, R.: The power of non-uniform wireless power. In: SODA, pp. 1595–1606 (2013)

    Google Scholar 

  20. Halldórsson, M.M., Konrad, C.: Distributed algorithms for coloring interval graphs. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 454–468. Springer, Heidelberg (2014)

    Google Scholar 

  21. Halldórsson, M.M., Mitra, P.: Nearly optimal bounds for distributed wireless scheduling in the SINR model. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 625–636. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: SODA (2011)

    Google Scholar 

  23. Halldórsson, M.M., Mitra, P.: Wireless capacity and admission control in cognitive radio. In: INFOCOM (2012)

    Google Scholar 

  24. Halldórsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: SODA (2012)

    Google Scholar 

  25. Halldórsson, M.M., Tonoyan, T.: How well can graphs represent wireless interference? In: STOC (2015)

    Google Scholar 

  26. Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 525–536. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  27. Jurdzinski, T., Kowalski, D.R., Rozanski, M., Stachowiak, G.: On the impact of geometry on ad hoc communication in wireless networks. In: PODC (2014)

    Google Scholar 

  28. Katz, B., Volker, M., Wagner, D.: Energy efficient scheduling with power control for wireless networks. In: WiOpt (2010)

    Google Scholar 

  29. Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: SODA (2011)

    Google Scholar 

  30. Kesselheim, T.: Approximation algorithms for wireless link scheduling with flexible data rates. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 659–670. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  31. Kesselheim, T., Vöcking, B.: Distributed contention resolution in wireless networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 163–178. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  32. Lin, H., Schalekamp, F.: On the complexity of the minimum latency scheduling problem on the Euclidean plane. arXiv preprint 1203.2725 (2012)

    Google Scholar 

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

    Google Scholar 

  34. Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM (2006)

    Google Scholar 

  35. Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall, Upper Saddle River (2002)

    Google Scholar 

  36. Son, D., Krishnamachari, B., Heidemann, J.: Experimental study of concurrent transmission in wireless sensor networks. In: SenSys (2006)

    Google Scholar 

  37. Tonoyan, T.: On some bounds on the optimum schedule length in the SINR model. In: Bar-Noy, A., Halldórsson, M.M. (eds.) ALGOSENSORS 2012. LNCS, vol. 7718, pp. 120–131. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tigran Tonoyan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Halldórsson, M.M., Konrad, C., Tonoyan, T. (2015). Limitations of Current Wireless Scheduling Algorithms. In: Bose, P., Gąsieniec, L., Römer, K., Wattenhofer, R. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2015. Lecture Notes in Computer Science(), vol 9536. Springer, Cham. https://doi.org/10.1007/978-3-319-28472-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28472-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28471-2

  • Online ISBN: 978-3-319-28472-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics