Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks

Abstract

Abstract — 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 across sessions, and depends on the “interference degree” in the two-hop neighborhood of the session. I.