TY - GEN
T1 - Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
AU - Leconte, Mathieu
AU - Ni, Jian
AU - Srikant, R.
PY - 2009
Y1 - 2009
N2 - Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been stud- ied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wire- less networks. In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, we obtain performance bounds that improve upon previous results for larger networks up to a certain size. We also provide a sim- ple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.
AB - Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been stud- ied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wire- less networks. In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, we obtain performance bounds that improve upon previous results for larger networks up to a certain size. We also provide a sim- ple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.
KW - Greedy maximal scheduling
KW - Longest queue first
KW - Throughput optimality
KW - Wireless networks
UR - http://www.scopus.com/inward/record.url?scp=70450206174&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70450206174&partnerID=8YFLogxK
U2 - 10.1145/1530748.1530771
DO - 10.1145/1530748.1530771
M3 - Conference contribution
AN - SCOPUS:70450206174
SN - 9781605585314
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 165
EP - 174
BT - MobiHoc'09 - Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing
T2 - 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09
Y2 - 18 May 2009 through 21 May 2009
ER -