期刊
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
卷 5, 期 4, 页码 313-325出版社
IEEE COMPUTER SOC
DOI: 10.1109/TNSE.2017.2764444
关键词
Epidemic detection; hypothesis testing
资金
- US National Science Foundation [CNS-1320175, EECS-1056028]
- DTRA [HDTRA 1-08-0029]
- ARO [W911NF-16-1-0377, W911NF-14-1-0387]
- US DOT
- European Union through the CONGAS project in the 7th Framework Programme
- Directorate For Engineering [1056028] Funding Source: National Science Foundation
- Div Of Electrical, Commun & Cyber Sys [1609279] Funding Source: National Science Foundation
Inspired by cyber-security applications, we consider the problem of detecting an infection process in a network when the indication that any particular node is infected is extremely noisy. Instead of waiting for a single node to provide sufficient evidence that it is indeed infected, we take advantage of the graph structure to detect cascades of weak indications of failures. We view the detection problem as a hypothesis testing problem, devise a new inference algorithm, and analyze its false positive and false negative errors in the high noise regime. Extensive simulations show that our algorithm is able to obtain low errors in the high noise regime by taking advantage of cascading topology analysis.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据