Sciweavers

Share
MOBIHOC
2009
ACM

Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

9 years 6 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wireless networks. In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, we obtain performance bounds that improve upon previous results for larger networks up to a certain size. We also provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design-Distributed networks, Wireless communication General Terms Algorithms, Performance Keywords Wireless networks, greedy maximal scheduling, longest queue first, throughput optimality
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where MOBIHOC
Authors Mathieu Leconte, Jian Ni, Rayadurgam Srikant
Comments (0)
books