Greedy Maximal Scheduling in Wireless Networks

Details Greedy Maximal Scheduling in Wireless Networks Greedy Maximal Scheduling in Wireless Networks

2010-07-27

arxiv.org/abs/1007.4840v1

Computer Science

Information Theory

6 pages, 3 figures. A shorter version will appear in IEEE Globecom 2010

Scientific paper

In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.

Affiliated with

Also associated with

No associations

Rating

Greedy Maximal Scheduling in Wireless Networks 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 Greedy Maximal Scheduling in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Maximal Scheduling in Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-73302