Information Source Localization with Protector Diffusion in Networks

Cited 4 time in webofscience Cited 5 time in scopus
  • Hit : 393
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorChoi, Jaeyoungko
dc.contributor.authorShin, Jinwooko
dc.contributor.authorYi, Yungko
dc.date.accessioned2019-06-12T08:30:10Z-
dc.date.available2019-06-12T08:30:10Z-
dc.date.created2019-06-12-
dc.date.created2019-06-12-
dc.date.created2019-06-12-
dc.date.created2019-06-12-
dc.date.issued2019-04-
dc.identifier.citationJOURNAL OF COMMUNICATIONS AND NETWORKS, v.21, no.2, pp.136 - 147-
dc.identifier.issn1229-2370-
dc.identifier.urihttp://hdl.handle.net/10203/262587-
dc.description.abstractRecently, the problem of detecting the information source in a network has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees if the number of infected nodes is sufficiently large. In this paper, we study the impact of an anti-information spreading on the original information source detection. We first show a negative result: the anti-information diffusion does not increase the detection probability under Maximum-Likelihood-Estimator (MLE) when the number of infected nodes are sufficiently large by passive diffusion that the anti-information starts to be spread by a special node, called the protector, after is reached by the original information. We next consider the case when the distance between the information source and the protector follows a certain type of distribution, but its parameter is hidden. Then, we propose the following learning algorithm: a) learn the distance distribution parameters under MLE, and b) detect the information source under Maximum-A-Posterior-Estimator (MAPE) based on the learnt parameters. We provide an analytic characterization of the source detection probability for regular trees under the proposed algorithm, where MAPE outperforms MLE by up to 50% for 3-regular trees and by up to 63% when the degree of the regular tree becomes large. We demonstrate our theoretical findings through numerical results, and further present the simulation results for general topologies (e.g., Facebook and US power grid networks) even without knowledge of the distance distribution, showing that under a simple protector placement algorithm, MAPE produces the detection probability much larger than that by MLE.-
dc.languageEnglish-
dc.publisherKOREAN INST COMMUNICATIONS SCIENCES (K I C S)-
dc.titleInformation Source Localization with Protector Diffusion in Networks-
dc.typeArticle-
dc.identifier.wosid000468443700005-
dc.identifier.scopusid2-s2.0-85075505461-
dc.type.rimsART-
dc.citation.volume21-
dc.citation.issue2-
dc.citation.beginningpage136-
dc.citation.endingpage147-
dc.citation.publicationnameJOURNAL OF COMMUNICATIONS AND NETWORKS-
dc.identifier.doi10.1109/JCN.2019.000020-
dc.identifier.kciidART002464064-
dc.contributor.localauthorShin, Jinwoo-
dc.contributor.localauthorYi, Yung-
dc.contributor.nonIdAuthorChoi, Jaeyoung-
dc.description.isOpenAccessY-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorEpidemic diffusion model-
dc.subject.keywordAuthorinformation source localization-
dc.subject.keywordAuthormaximum likelihood estimator-
Appears in Collection
AI-Journal Papers(저널논문)EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0