Files in this item

FilesDescriptionFormat

application/pdf

application/pdfMaguluri_sivaTheja.pdf (304kB)
(no description provided)PDF

Description

Title:Optimal scheduling algorithms for ad hoc wireless networks
Author(s):Maguluri, Siva Theja
Advisor(s):Hajek, Bruce; Srikant, Rayadurgam
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(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.
Issue Date:2011-05-25
URI:http://hdl.handle.net/2142/24097
Rights Information:Copyright 2010 Siva Theja Maguluri
Date Available in IDEALS:2011-05-25
Date Deposited:2011-05


This item appears in the following Collection(s)

Item Statistics