Skip to main content

Approximation Algorithms for Wireless Spectrum Allocation with Power Control

  • Conference paper
Algorithms for Sensor Systems (ALGOSENSORS 2012)

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

  • 787 Accesses

Abstract

Radio spectrum is one of the most valuable resources necessary to run wireless networks. Unfortunately, somewhat wasteful allocation has made it very scarce nowadays. Therefore, for future wireless evolution, we need smart algorithms that manage wireless spectrum access inside and between networks.

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

Access this chapter

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 49.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

References

  1. Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), pp. 1332–1340 (2009)

    Google Scholar 

  2. Halldórsson, M.M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361–372. Springer, Heidelberg (2009)

    Google Scholar 

  3. Halldórsson, M.M., Holzer, S., Mitra, P., Wattenhofer, R.: The power of non-uniform wireless power. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms, SODA (to appear (2013)

    Google Scholar 

  4. Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1538–1548 (2011)

    Google Scholar 

  5. Hoefer, M., Kesselheim, T.: Secondary spectrum auctions for symmetric and submodular bidders. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 657–671 (2012)

    Google Scholar 

  6. Hoefer, M., Kesselheim, T., Vöcking, B.: Approximation algorithms for secondary spectrum auctions. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 177–186 (2011)

    Google Scholar 

  7. Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1549–1559

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Wan, P.-J., Ma, C., Tang, S., Xu, B.: Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode. In: Cheng, Y., Do Eun, Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 84–95. Springer, Heidelberg (2011)

    Google Scholar 

  10. Ye, Y., Borodin, A.: Elimination Graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 774–785. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kesselheim, T. (2013). Approximation Algorithms for Wireless Spectrum Allocation with Power Control. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36092-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36091-6

  • Online ISBN: 978-3-642-36092-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics