1 Approximation Algorithms for Throughput Maximization in Wireless Networks with Delay Constraints

Abstract—We study the problem of throughput maximization in multi-hop 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 trade-off between the end-to-end delays and the total achievable rate. We develop algorithms to compute such trade-offs 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∆m of the maximum, so that the loglog∆m per-session (end-to-end) delay is O ( ( log∆m loglog∆m ∆(c))2) , where ∆m = maxc{∆(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