2026-09-21T20:29:02Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/14629 2023-07-10 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Srikant, Rayadurgam Srikant, Rayadurgam Leconte, Mathieu 2010-01-06T16:20:06Z 2010-01-06T16:20:06Z 2010-01-06T16:20:06Z 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. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2009-11-18T14:46:40Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Leconte_Mathieu.pdf: 253137 bytes, checksum: adaa8355ecea700ed754d19d51136c67 (MD5) Made available in DSpace on 2010-01-06T16:20:06Z (GMT). No. of bitstreams: 2 license.txt: 4065 bytes, checksum: 8a903a05156264e0f4f982cc5bc4fcaa (MD5) Leconte_Mathieu.pdf: 253137 bytes, checksum: adaa8355ecea700ed754d19d51136c67 (MD5) http://hdl.handle.net/2142/14629 en Copyright 2009 Mathieu Leconte Greedy Maximal Scheduling Longest Queue First wireless network throughput optimality throughput efficiency 2009-12 On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks Electrical & Computer Eng 1933 Electrical & Computer Engr 1200 University of Illinois at Urbana-Champaign Thesis M.S. MS:Electr & Computer Eng-UIUC 10KS1200MS