Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Greedy Maximal Scheduling"”.
-
On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks
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 …
-
Low Complexity Scheduling in Wireless Networks
Scheduling complexity is an important bottleneck in the efficient design and controlof wireless networks. Owing to the high computational complexity of throughputoptimallink schedulers, low-complexity schedulers such as Greedy Maximal Scheduling(GMS)that often yield good throughput performance have …