Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TNET.2014.2323998 | Networking, IEEE/ACM Transactions |
Keywords | Field | DocType |
chernoff bound,low-complexity and distributed algorithms,maximal scheduling,wireless scheduling algorithms,scheduling algorithms,interference,random variables,wireless networks,indexes | Wireless network,Inter-Access Point Protocol,Fair-share scheduling,Computer science,Scheduling (computing),Computer network,Theoretical computer science,Rate-monotonic scheduling,Chernoff bound,Round-robin scheduling,Lemma (mathematics),Distributed computing | Journal |
Volume | Issue | ISSN |
PP | 99 | 1063-6692 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhang, F. | 1 | 0 | 0.34 |
| Yewen Cao | 2 | 0 | 1.69 |
| Deqiang Wang | 3 | 0 | 0.34 |