Maximal Scheduling in Wireless Networks with Priorities

Details Maximal Scheduling in Wireless Networks with Priorities Maximal Scheduling in Wireless Networks with Priorities

2011-12-02

arxiv.org/abs/1112.0539v1

Computer Science

Information Theory

10 pages, 6 figures

Scientific paper

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain pre-specified static priorities. The proposed scheduling scheme is simple, which is easily amendable for distributed implementation in practice, such as using inter-frame space (IFS) parameters under the ubiquitous 802.11 protocols. To obtain throughput guarantees, we first analyze the case of maximal scheduling with a fixed priority vector, and formulate a lower bound on its stability region and scheduling efficiency. We further propose a low complexity priority assignment algorithm, which can stabilize any arrival rate that is in the union of the lower bound regions of all priorities. The stability result is proved using fluid limits, and can be applied to very general stochastic arrival processes. Finally, the performance of the proposed prioritized maximal scheduling scheme is verified by simulation results.

Affiliated with

Also associated with

No associations

Rating

Maximal Scheduling in Wireless Networks with Priorities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal Scheduling in Wireless Networks with Priorities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal Scheduling in Wireless Networks with Priorities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141166