Optimal scheduling algorithms for ad hoc wireless networks

Maguluri, Siva Theja

Permalink

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

Description

Title

Optimal scheduling algorithms for ad hoc wireless networks

Author(s)

Maguluri, Siva Theja

Issue Date

2011-05-25T14:58:48Z

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

• Hajek, Bruce
• 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)

• Adhoc Networks
• Scheduling
• Wireless
• Lyapunov
• optimal

Abstract

It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF). A synchronous version of LQF is known to be throughput-optimal under a topological condition called local pooling. Here we study an asynchronous version of LQF which is suitable for implementation in networks with variable packet sizes. We show that asynchronous LQF is also throughput-optimal under the local pooling condition.

Graduation Semester

2011-05

Permalink

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

Copyright and License Information

Copyright 2010 Siva Theja Maguluri

Owning Collections