Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLuo, Wuqiongen
dc.contributor.authorTay, Wee Pengen
dc.identifier.citationLuo, W., & Tay, W. P. (2012). Identifying infection sources in large tree networks. 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 281-289.en
dc.description.abstractEstimating which nodes in a network are the infection sources, including the individuals who started a rumor in a social network, the computers that introduce a virus into a computer network, or the index cases of a contagious disease, plays a critical role in identifying the influential nodes in a network, and in some applications, limiting the damage caused by the infection through timely quarantine of the sources. We consider the problem of estimating the infection sources, based only on knowledge of the underlying network connections. We derive estimators based on approximations of the infection sequences counts. We show that if there are at most two infection sources in a geometric tree, our estimator identifies these sources with probability going to one as the number of infected nodes increases. When there are more than two infection sources, we present heuristics that have quadratic complexity. We show through simulations that our proposed estimators can correctly identify the infection sources to within a few hops with high probability.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titleIdentifying infection sources in large tree networksen
dc.typeConference Paperen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.contributor.conferenceConference on Sensor, Mesh and Ad Hoc Communications and Networks (9th : 2012 : Seoul, Korea)en
item.fulltextNo Fulltext-
Appears in Collections:EEE Conference Papers

Citations 20

Updated on Jan 20, 2023

Page view(s) 50

Updated on Jan 28, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.