{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/24097"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/24097","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimal scheduling algorithms for ad hoc wireless networks","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Maguluri, Siva Theja"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Hajek, Bruce","Srikant, Rayadurgam"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-25T14:58:48Z","date_published":"2011-05-25T14:58:48Z","updated_at":"2026-07-22T22:25:23Z","subjects":["Adhoc Networks","Scheduling","Wireless","Lyapunov","optimal"],"languages":["en"],"rights":["Copyright 2010 Siva Theja Maguluri"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/24097","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hajek, Bruce","Srikant, Rayadurgam"]},{"key":"dc:creator","label":"Author","values":["Maguluri, Siva Theja"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-25T14:58:48Z","2011-05"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Adhoc Networks","Scheduling","Wireless","Lyapunov","optimal"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Siva Theja Maguluri"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/24097"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-05T15:55:16Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Maguluri_SivaTheja.zip: 323862 bytes, checksum: 28c39ed7460e64c5ff757e63bd25f1bb (MD5) Maguluri_sivaTheja.pdf: 304407 bytes, checksum: 12256d41b322acb5c97e4c207231641d (MD5)","Made available in DSpace on 2011-05-25T14:58:48Z (GMT). No. of bitstreams: 3 Maguluri_sivaTheja.pdf: 304407 bytes, checksum: 12256d41b322acb5c97e4c207231641d (MD5) license.txt: 4063 bytes, checksum: 8459bd9daf59bef5b05f992d84f476d9 (MD5) Maguluri_SivaTheja.zip: 323862 bytes, checksum: 28c39ed7460e64c5ff757e63bd25f1bb (MD5)"]},{"key":"dc:title","label":"Title","values":["Optimal scheduling algorithms for ad hoc wireless networks"]}]}],"canonical_facts":{"dc:contributor":["Hajek, Bruce","Srikant, Rayadurgam"],"dc:creator":["Maguluri, Siva Theja"],"dc:date":["2011-05-25T14:58:48Z","2011-05"],"dc:description":["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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-05T15:55:16Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Maguluri_SivaTheja.zip: 323862 bytes, checksum: 28c39ed7460e64c5ff757e63bd25f1bb (MD5) Maguluri_sivaTheja.pdf: 304407 bytes, checksum: 12256d41b322acb5c97e4c207231641d (MD5)","Made available in DSpace on 2011-05-25T14:58:48Z (GMT). No. of bitstreams: 3 Maguluri_sivaTheja.pdf: 304407 bytes, checksum: 12256d41b322acb5c97e4c207231641d (MD5) license.txt: 4063 bytes, checksum: 8459bd9daf59bef5b05f992d84f476d9 (MD5) Maguluri_SivaTheja.zip: 323862 bytes, checksum: 28c39ed7460e64c5ff757e63bd25f1bb (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/24097"],"dc:language":["en"],"dc:rights":["Copyright 2010 Siva Theja Maguluri"],"dc:subject":["Adhoc Networks","Scheduling","Wireless","Lyapunov","optimal"],"dc:title":["Optimal scheduling algorithms for ad hoc wireless networks"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:23Z"}