Performance of random access scheduling schemes in multi-hop wireless networks

Authors:
Changhee Joo;Ness B. Shroff
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 9
Cited 5

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
On the stability of input-queued switches with speed-up

IEEE/ACM Transactions on Networking (TON)
On the Distributed Complexity of Computing Maximal Matchings

SIAM Journal on Discrete Mathematics
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximum Weighted Matching with Interference Constraints

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

IEEE Transactions on Information Theory

Longest-queue-first scheduling under SINR interference model

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Joint random access and power control game in ad hoc networks with noncooperative users

Ad Hoc Networks
A refined performance characterization of longest-queue-first policy in wireless networks

IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling for wireless networks

Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Delay-based back-pressure scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling problem in multi-hop wireless networks has been extensively investigated. Although throughput optimal scheduling solutions have been developed in the literature, they are unsuitable for multi-hop wireless systems because they are usually centralized and have very high complexity. In this paper, we develop a random-access based scheduling scheme that utilizes local information. The important features of this scheme include constant-time complexity, distributed operations, and a provable performance guarantee. Analytical results show that it guarantees a larger fraction of the optimal throughput performance than the state-of-the-art. Through simulations with both single-hop and multi-hop traffics, we observe that the scheme provides high throughput, close to that of a well-known highly efficient centralized greedy solution called the Greedy Maximal Scheduler.