DocumentCode
19839
Title
A Note on “Low-Complexity Distributed Scheduling Algorithms for Wireless Networks” [Dec 09 1846-1859]
Author
Fan Zhang ; Yewen Cao ; Deqiang Wang
Author_Institution
Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan, China
Volume
23
Issue
4
fYear
2015
fDate
Aug. 2015
Firstpage
1367
Lastpage
1369
Abstract
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.
Keywords
radiocommunication; telecommunication scheduling; distributed scheduling algorithms; wireless networks; Algorithm design and analysis; Distributed algorithms; Scheduling algorithms; Wireless networks; Chernoff bound; low-complexity and distributed algorithms; maximal scheduling; wireless scheduling algorithms;
fLanguage
English
Journal_Title
Networking, IEEE/ACM Transactions on
Publisher
ieee
ISSN
1063-6692
Type
jour
DOI
10.1109/TNET.2014.2323998
Filename
6820778
Link To Document