SCIENCE@home

Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints

Guanhong Pei,S. Parthasarathy,A. Srinivasan,A. Vullikanti

Published 2011 in IEEE/ACM Transactions on Networking

ABSTRACT

We study the problem of throughput maximization in multihop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O(log Δ<sub>m</sub>/loglog Δ<sub>m</sub>) of the maximum, so that the per-session (end-to-end) delay is O(((log Δ<sub>m</sub>/loglog Δ<sub>m</sub>)Δ(c))<sup>2</sup>), where Δ<sub>m</sub>=max<sub>c</sub>{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-49 of 49 references · Page 1 of 1

CITED BY

Showing 1-15 of 15 citing papers · Page 1 of 1