SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Routing without routes: the backpressure collection protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Scheduling in multichannel wireless networks with flow-level dynamics
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Local Greedy Approximation for Scheduling in Multihop Wireless Networks
IEEE Transactions on Mobile Computing
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
Providing quality of service over a shared wireless link
IEEE Communications Magazine
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However, these queue-length-based schemes could potentially suffer from large (even infinite) packet delays due to the well-known last packet problem, whereby packets belonging to some flows may be excessively delayed due to lack of subsequent packet arrivals. Delay-based schemes have the potential to resolve this last packet problem by scheduling the link based on the delay the packet has encountered. However, characterizing throughput optimality of these delay-based schemes has largely been an open problem in multihop wireless networks (except in limited cases where the traffic is single-hop). In this paper, we investigate delay-based scheduling schemes for multihop traffic scenarios with fixed routes. We develop a scheduling scheme based on a new delay metric and show that the proposed scheme achieves optimal throughput performance. Furthermore, we conduct simulations to support our analytical results and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queue-length-based scheme.