Distributed Greedy approximation to Maximum Weighted Independent Set for scheduling with fading channels

Keyphrases

• Scheduling Scheme 100%
• Greedy Approximation 100%
• Maximum Weight Independent Set 100%
• Fading Channels 100%
• IEEE 802.11 66%
• Fading Environment 66%
• 802.11 DCF 66%
• Scheduling Algorithm 33%
• Channel Condition 33%
• Scheduling Mechanism 33%
• Scheduler 33%
• Network Size 33%
• Delay Performance 33%
• Experiment Results 33%
• Fasting Time 33%
• Achievable Throughput 33%
• Network Context 33%
• Distributed Scheduling 33%
• Greedy 33%
• Throughput Optimality 33%
• Wireless Channel Fading 33%
• Good Performance 33%
• Performance Guarantee 33%
• Low-complexity Algorithm 33%
• Realistic Network 33%

Computer Science

• Approximation (Algorithm) 100%
• Scheduling Scheme 100%
• Fading Channel 100%
• Independent Set 100%
• IEEE 802.11 66%
• Fading Environment 66%
• Good Performance 33%
• Scheduling Algorithm 33%
• Channel Condition 33%
• Algorithmic Efficiency 33%
• Scheduling Mechanism 33%
• Testbed 33%
• Local Information 33%
• Performance Guarantee 33%
• Distributed Scheduling 33%