标题:A Note on \"Low-Complexity Distributed Scheduling Algorithms for Wireless Networks\"
作者:Zhang, Fan;Cao, Yewen;Wang, Deqiang
作者机构:[Zhang, F] School of Information Science and Engineering, Shandong University, Jinan, 250100, China;[ Cao, Y] School of Information Science and Engine 更多
通讯作者地址:[Zhang, F]Shandong Univ, Sch Informat Sci & Engn, Jinan 250100, Peoples R China.
来源:IEEE/ACM Transactions on Networking: A Joint Publication of the IEEE Communications Soceity, the IEEE Computer Society, and the ACM with Its Special Interest Group on Data Communication
出版年:2015
卷:23
期:4
页码:1367-1369
DOI:10.1109/TNET.2014.2323998
关键词:Chernoff bound;low-complexity and distributed algorithms;maximal scheduling;wireless scheduling algorithms
摘要: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.
收录类别:EI;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85028207905&doi=10.1109%2fTNET.2014.2323998&partnerID=40&md5=b59573a26bf8b9bf44ed31fd34d37e50
TOP