Approximation algorithms for throughput maximization in wireless networks with delay constraints

—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-toend 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-toend) 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.

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Aravind Srinivasan
• Keywords: Communications, INFOCOM 2011, Log ∆m, Multi-hop Wireless Networks, ∆m Log