About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
INFOCOM 2011
Conference paper
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 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. © 2011 IEEE.