Upperbounding End-to-End Throughput of Multihop Wireless Networks

  • Hong Lu
  • Steve Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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)CrossRefGoogle Scholar
  4. 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. 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. 6.
    Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 2, 388–404 (2000)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE/ACM Transaction on Networking 1(2), 166–177 (1993)CrossRefGoogle Scholar
  8. 8.
    Wagler, A.: Rank-perfect and weakly rank-perfect graphs. Mathematical Methods of operations research (2002)Google Scholar
  9. 9.
  10. 10.
    Hajek, B., Sasaki, G.: Link scheduling in polynomial time. ACM/IEEE Transactions on Information Theory 34(5) (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hong Lu
    • 1
  • Steve Liu
    • 1
  1. 1.Department of Computer ScienceTexas A&M University 

Personalised recommendations