On the throughput efficiency of greedy maximal scheduling in wireless ad hoc 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 thesis, we derive performance bounds of GMS for wireless networks under the general k-hop interference model. In particular, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, the obtained performance bounds 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.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical & Computer Engr

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2010

Author dc:creator

• Leconte, Mathieu

Contributors dc:contributor

• Srikant, Rayadurgam

• Greedy Maximal Scheduling
• Longest Queue First
• wireless network
• throughput optimality
• throughput efficiency

Statement dc:rights

• Copyright 2009 Mathieu Leconte

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/14629

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/14629