On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks

Greedy Maximal Scheduling;Longest Queue First;wireless network;throughput optimality;throughput efficiency

Leconte, Mathieu ; Srikant, Rayadurgam ; Srikant ; Rayadurgam

关键词: Greedy Maximal Scheduling;    Longest Queue First;    wireless network;    throughput optimality;    throughput efficiency;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/14629/Leconte_Mathieu.pdf?sequence=2&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has beenstudied extensively for wireless networks. However, GMS can result in degraded throughput performance ingeneral wireless networks. In this thesis, we derive performance bounds of GMS for wireless networks under thegeneral k-hop interference model. In particular, we prove that GMS achieves 100% throughput in allnetworks with eight nodes or less, under the two-hop interference model. Further, the obtained performancebounds improve upon previous results for larger networks up to a certain size. We also provide a simple proofto show that GMS can be implemented using only local neighborhood information in networks of any size.