Throughput-optimal scheduling in multihop wireless networks without per-flow information

Authors:
Bo Ji;Changhee Joo;Ness B. Shroff
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;School of Electrical and Computer Engineering, Ulsan National Institute of Science and Technology, Ulsan, Korea;Departments of Electrical and Computer Engineering and Computer Science and Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 8
Cited 0

Stability of Multiclass Queueing Networks Under Priority Service Disciplines

Operations Research
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
On the complexity of scheduling in wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Large number of queues in tandem: Scaling properties under back-pressure algorithm

Queueing Systems: Theory and Applications
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of link scheduling in multihop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous flows. Also, the backpressure algorithm maintains a complex data structure at each node, keeps exchanging queue-length information among neighboring nodes, and commonly results in poor delay performance. In this paper, we propose scheduling schemes that can circumvent these drawbacks and guarantee throughput optimality. These schemes use either the readily available hop-count information or only the local information for each link. We rigorously analyze the performance of the proposed schemes using fluid limit techniques via an inductive argument and show that they are throughput-optimal. We also conduct simulations to validate our theoretical results in various settings and show that the proposed schemes can substantially improve the delay performance in most scenarios.