Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks

• Published in: IEEE/ACM transactions on networking Vol. 19; no. 3; pp. 709 - 720
• Main Authors: Leconte, M, Jian Ni, Srikant, R
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2011; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Computational modeling; Greedy Maximal Scheduling (GMS); Interference; Longest Queue First (LQF); Networks; Numerical models; Proving; Schedules; Scheduling; Scheduling algorithm; Throughput; throughput optimality; Topology; Wireless networks
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2010.2089534

In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general k -hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We also prove that GMS is throughput-optimal in small networks. In particular, we show that GMS achieves 100% throughput in networks with up to eight nodes under the 2-hop interference model. Furthermore, we provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.