Skip to main content

Upperbounding End-to-End Throughput of Multihop Wireless Networks

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4138))

  • 726 Accesses

Abstract

End-to-end throughput θ sd is the maximum amount of data that can be successfully delivered from source s to sink d across a given network in unit time. Determining θ sd is essential to understanding the network limit and is of important value to network design and evaluation. In the past few years, the problem of computing θ sd in multihop wireless networks has been extensively studied in the literature. It has been shown that this problem is NP-hard in general and various approaches have been proposed to compute approximate solutions. In this paper, we study one side of the problem, computing the upperbound of θ sd . We present a general solution framework based on linear program LP\((\mathcal{F})\), where \(\mathcal{F}\) is an arbitrary set of link sets. We show each choice of \(\mathcal{F}\) corresponds to an upperbound of θ sd and identify several good choice of \(\mathcal{F}\) based on the notions of clique and congestion. The tightness of these clique and congestion based upperbounds are evaluated by simulation.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

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.

Similar content being viewed by others

References

  1. Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact of interference on multi-hop wireless network performance. In: Proceedings of the 9th annual international conference on Mobile computing and networking(Mobicom), pp. 66–80 (2003)

    Google Scholar 

  2. Kumar, V.A., Marathey, M.V., Parthasarathyz, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. In: International Conference on Measurement and Modeling of Computer Systems(Sigmetrics) (2005)

    Google Scholar 

  3. Kodialam, M., Nandagopal, T.: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. In: Proceedings of the 9th annual international conference on Mobile computing and networking(Mobicom), pp. 42–54. ACM Press, New York (2003)

    Chapter  Google Scholar 

  4. Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: Proceedings of the 11th annual international conference on Mobile computing and networking(Mobicom), pp. 73–87 (2005)

    Google Scholar 

  5. Alicherry, M., Bhatia, R., Li, L.E.: Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In: Proceedings of the 11th annual international conference on Mobile computing and networking(Mobicom), pp. 58–72 (2005)

    Google Scholar 

  6. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 2, 388–404 (2000)

    Article  MathSciNet  Google Scholar 

  7. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE/ACM Transaction on Networking 1(2), 166–177 (1993)

    Article  Google Scholar 

  8. Wagler, A.: Rank-perfect and weakly rank-perfect graphs. Mathematical Methods of operations research (2002)

    Google Scholar 

  9. [Online] Available: http://groups.yahoo.com/group/lp_solve

  10. Hajek, B., Sasaki, G.: Link scheduling in polynomial time. ACM/IEEE Transactions on Information Theory 34(5) (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, H., Liu, S. (2006). Upperbounding End-to-End Throughput of Multihop Wireless Networks. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_63

Download citation

  • DOI: https://doi.org/10.1007/11814856_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37189-2

  • Online ISBN: 978-3-540-37190-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics