%0 Conference Paper %B 2011 Proceedings IEEE INFOCOM %D 2011 %T Approximation algorithms for throughput maximization in wireless networks with delay constraints %A Guanhong Pei %A Anil Kumar,V. S %A Parthasarathy,S. %A Srinivasan, Aravind %K Approximation algorithms %K Approximation methods %K approximation theory %K Delay %K delay constraints %K delays %K general interference model %K Interference %K multihop wireless networks %K optimisation %K Optimized production technology %K radio networks %K radiofrequency interference %K target delay bound %K Throughput %K throughput maximization %K Wireless networks %X 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 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Δm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δ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. %B 2011 Proceedings IEEE INFOCOM %I IEEE %P 1116 - 1124 %8 2011/04/10/15 %@ 978-1-4244-9919-9 %G eng %R 10.1109/INFCOM.2011.5934887