Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks

@inproceedings{Chaporkar2006AchievingQS,
  title={Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks},
  author={Prasanna Chaporkar},
  year={2006}
}
We address the question of attaining stability guarantees through distributed scheduling in wireless networks. We consider a simple, local information based, distributed scheduling strategy, maximal scheduling, and prove that it attains a guaranteed fraction of the maximum stability region. By considering the notion of queue-length stability, we strengthen existing rate stability results for maximal scheduling. The queuelength stability guarantees provided by maximal scheduling can differ… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

Low-Complexity Distributed Scheduling Algorithms for Wireless Networks

IEEE/ACM Transactions on Networking • 2007
View 8 Excerpts
Highly Influenced

Stability Analysis of Reservation-Based Scheduling Policies in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems • 2012
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Bounds on the capacity region of multihop wireless networks under distributed greedy scheduling

X. Wu, R. Srikant
Proceedings of INFOCOM, • 2006
View 3 Excerpts
Highly Influenced

Fairness and Throughput Guarantees with Maximal Scheduling in Multi-hop Wireless Networks

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks • 2006
View 5 Excerpts

Computing: A Locality-sensitive Approach

D. Peleg.Distributed
Society of Industrial and Applied Mathematics, • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…