Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network optimization and control
Foundations and Trends® in Networking
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
IEEE/ACM Transactions on Networking (TON)
Delay reduction via lagrange multipliers in stochastic network optimization
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
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
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Quantifying the end-to-end delay performance in multihop wireless networks is a well-known challenging problem. In this paper, we propose a new joint congestion control and scheduling algorithm for multihop wireless networks with fixed-route flows operated under a general interference model with interference degree κ. Our proposed algorithm not only achieves a provable throughput guarantee (which is close to at least 1/κ of the system capacity region), but also leads to explicit upper bounds on the end-to-end delay of every flow. Our end-to-end delay and throughput bounds are in simple and closed forms, and they explicitly quantify the tradeoff between throughput and delay of every flow. Furthermore, the per-flow end-to-end delay bound increases linearly with the number of hops that the flow passes through, which is order-optimal with respect to the number of hops. Unlike traditional solutions based on the backpressure algorithm, our proposed algorithm combines window-based flow control with a new rate-based distributed scheduling algorithm. A key contribution of our work is to use a novel stochastic dominance approach to bound the corresponding per-flow throughput and delay, which otherwise are often intractable in these types of systems. Our proposed algorithm is fully distributed and requires a low per-node complexity that does not increase with the network size. Hence, it can be easily implemented in practice.