Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

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 i...Show More

Abstract:

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.
Published in: IEEE/ACM Transactions on Networking ( Volume: 19, Issue: 3, June 2011)
Page(s): 709 - 720
Date of Publication: 15 November 2010

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.