A Greedy Link Scheduler for Wireless Networks with Fading Channels

Details A Greedy Link Scheduler for Wireless Networks with Fading Channels A Greedy Link Scheduler for Wireless Networks with Fading Channels

2012-03-09

arxiv.org/abs/1203.2024v1

Computer Science

Networking and Internet Architecture

Scientific paper

We consider the problem of link scheduling for wireless networks with fading channels, where the link rates are varying with time. Due to the high computational complexity of the throughput optimal scheduler, we provide a low complexity greedy link scheduler GFS, with provable performance guarantees. We show that the performance of our greedy scheduler can be analyzed using the Local Pooling Factor (LPF) of a network graph, which has been previously used to characterize the stability of the Greedy Maximal Scheduling (GMS) policy for networks with static channels. We conjecture that the performance of GFS is a lower bound on the performance of GMS for wireless networks with fading channels

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302035