Longest-queue-first scheduling under SINR interference model

Authors:
Long Bao Le;Eytan Modiano;Changhee Joo;Ness B. Shroff
Affiliations:
Massachusettes Institute of Technology, Cambridge, MA, USA;Massachusettes Institute of Technology, Cambridge, MA, USA;Korea University of Technology and Education, Cheonan, Chungnam, South Korea;The Ohio State University, Columbus, OH, USA
Venue:
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Year:
2010

Citing 15
Cited 6

Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
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)
Fairness and optimal stochastic control for heterogeneous networks

IEEE/ACM Transactions on Networking (TON)
Distributed throughput maximization in wireless mesh networks via pre-partitioning

IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multiflows in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and 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
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks

IEEE/ACM Transactions on Networking (TON)
Distributed throughput maximization in wireless networks via random power allocation

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Optimal control of wireless networks with finite buffers

INFOCOM'10 Proceedings of the 29th conference on Information communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints

IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

IEEE Transactions on Information Theory

Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

IEEE/ACM Transactions on Networking (TON)
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels

IEEE/ACM Transactions on Networking (TON)
Brief announcement: distributed algorithms for throughput performance in wireless networks

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Wireless network stability in the SINR model

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Optimal control of wireless networks with finite buffers

IEEE/ACM Transactions on Networking (TON)
Adaptive instantiation of the protocol interference model in wireless networked sensing and control

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference model takes network geometry and the cumulative interference effect into account, which, therefore, capture the wireless interference more precisely than binary interference models. By employing the ρ-local pooling technique, we show that LQF scheduling achieves zero throughput in the worst case. We then propose a novel technique to localize interference which enables us to decentralize the LQF scheduling while preventing it from having vanishing throughput in all network topologies. We characterize the maximum throughput region under interference localization and present a distributed LQF scheduling algorithm. Finally, we present numerical results to illustrate the usefulness and to validate the theory developed in the paper.