On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks

Leconte, Mathieu

Permalink

https://hdl.handle.net/2142/14629 Copy

Description

Title

On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks

Author(s)

Leconte, Mathieu

Issue Date

2010-01-06T16:20:06Z

Director of Research (if dissertation) or Advisor (if thesis)

Srikant, Rayadurgam

Doctoral Committee Chair(s)

Srikant, Rayadurgam

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

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

Abstract

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.

Graduation Semester

2009-12

Permalink

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

Copyright and License Information

Copyright 2009 Mathieu Leconte

Owning Collections