Skip to main content

On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources

  • Conference paper
Algorithms - ESA 2009 (ESA 2009)

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

Included in the following conference series:

Abstract

The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received much attention in recent years. In this paper, we investigate the question of how much the worst-case performance of uniform and non-uniform power assignments differ under constraints such as a bound on the area where nodes are distributed or restrictions on the maximum power available. We determine the maximum factor by which a non-uniform power assignment can outperform the uniform case in the SINR model. More precisely, we prove that in one-dimensional settings the capacity of a non-uniform assignment exceeds a uniform assignment by at most a factor of O(logL max ) when the length of the network is L max . In two-dimensional settings, the uniform assignment is at most a factor of O(logP max ) worse than the non-uniform assignment if the maximum power is P max . We provide algorithms that reach this capacity in both cases. Due to lower bound examples in previous work, these results are tight in the sense that there are networks where the lack of power control causes a performance loss in the order of these factors. As a consequence, engineers and researchers may prefer the uniform model due to its simplicity if this degree of performance deterioration is acceptable.

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 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. Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. In: Proc. 28th Symposium on Principles of Distributed Computing, PODC (2009)

    Google Scholar 

  2. Avin, C., Lotker, Z., Pasquale, F., Pignolet, Y.A.: A Note on Uniform Power Connectivity in the SINR Model. In: Proc.5th Intl Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSOR (2009)

    Google Scholar 

  3. Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious Interference Scheduling. In: Proc. 28th Symposium on Principles of Distributed Computing (PODC) (2009)

    Google Scholar 

  4. Fanghänel, A., Keßelheim, T., Vöcking, B.: Improved Algorithms for Latency Minimization in Wireless Networks. 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)

    Google Scholar 

  5. Goussevskaia, O., Halldorsson, M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: 28th Annual IEEE Conference on Computer Communications (INFOCOM) (2009)

    Google Scholar 

  6. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Montreal, Canada (September 2007)

    Google Scholar 

  7. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Trans. Inf. Theory 46(2), 388–404 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Halldórsson, M.: Wireless Scheduling with Power Control. In: Proc. 17th annual European Symposium on Algorithms (ESA), pp. 368–380 (2009)

    Google Scholar 

  9. Halldorsson, 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)

    Google Scholar 

  10. Moscibroda, T.: The worst-case capacity of wireless sensor networks. In: Proc. 6th Conference on Information Processing in Sensor Networks, IPSN (2007)

    Google Scholar 

  11. Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How Optimal are Wireless Scheduling Protocols? In: Proc. 26th IEEE Conference on Computer Communications (INFOCOM) (2007)

    Google Scholar 

  12. Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proc. 25th Conference of the IEEE Computer and Communications Societies, INFOCOM (2006)

    Google Scholar 

  13. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-based Models. In: Proc. 5th ACM SIGCOMM Workshop on Hot Topics in Networks, HOTNETS (2006)

    Google Scholar 

  14. Pillai, S., Suel, T., Cha, S.: The Perron-Frobenius theorem. IEEE Signal Processing Magazine 22(2), 62–75 (2005)

    Article  Google Scholar 

  15. Rappaport, T.: Wireless communications. Prentice-Hall, Englewood Cliffs (2002)

    Google Scholar 

  16. Zander, J.: Performance of optimum transmitter power control in cellular radio systems. IEEE Trans. Veh. Technol. 41 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avin, C., Lotker, Z., Pignolet, YA. (2009). On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04128-0_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04127-3

  • Online ISBN: 978-3-642-04128-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics