Discrete Mathematics - Topics on domination
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Randomized algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Coordinated network scheduling: a framework for end-to-end services
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
An Extension of the Lova´sz Local Lemma, and its Applications to Integer Programming
SIAM Journal on Computing
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Optimal delay scheduling in networks with arbitrary constraints
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On path selection and rate allocation for video in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic
IEEE/ACM Transactions on Networking (TON)
Performance of wireless networks with hidden nodes: a queuing-theoretic analysis
Computer Communications
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient network QoS provisioning based on per node traffic shaping
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
The information-theoretic capacity of discrete-time queues
IEEE Transactions on Information Theory
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We study the problem of throughput maximization in multihop 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 Δm) of the maximum, so that the persession (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.