Approximation algorithms for throughput maximization in wireless networks with delay constraints
| Title | Approximation algorithms for throughput maximization in wireless networks with delay constraints |
| Publication Type | Conference Papers |
| Year of Publication | 2011 |
| Authors | Pei G, Anil Kumar VS, Parthasarathy S, Srinivasan A |
| Conference Name | 2011 Proceedings IEEE INFOCOM |
| Date Published | 2011/04/10/15 |
| Publisher | IEEE |
| ISBN Number | 978-1-4244-9919-9 |
| Keywords | Approximation algorithms, Approximation methods, approximation theory, Delay, delay constraints, delays, general interference model, Interference, multihop wireless networks, optimisation, Optimized production technology, radio networks, radiofrequency interference, target delay bound, Throughput, throughput maximization, Wireless networks |
| 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 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. |
| DOI | 10.1109/INFCOM.2011.5934887 |