A Note on "Low-Complexity Distributed Scheduling Algorithms for Wireless Networks" [Dec 09 1846-1859]

We point out a flaw involved in the proof of Lemma 2 in the above-cited paper (IEEE/ACM Trans. Netw., vol. 17, no. 6, pp. 1846-1859, Dec. 2009) and provide a corrected version.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking 2015-08, Vol.23 (4), p.1367-1369
Hauptverfasser:	Zhang, Fan, Cao, Yewen, Wang, Deqiang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Chernoff bound Distributed algorithms low-complexity and distributed algorithms maximal scheduling Scheduling algorithms Wireless networks wireless scheduling algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We point out a flaw involved in the proof of Lemma 2 in the above-cited paper (IEEE/ACM Trans. Netw., vol. 17, no. 6, pp. 1846-1859, Dec. 2009) and provide a corrected version.
ISSN:	1063-6692 1558-2566
DOI:	10.1109/TNET.2014.2323998