DocumentCode
272015
Title
Network observability and localization of sources of diffusion in tree networks with missing edges
Author
Zejnilovic, Sabina ; Gomes, João ; Sinopoli, Bruno
Author_Institution
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
2014
fDate
1-5 Sept. 2014
Firstpage
2345
Lastpage
2349
Abstract
In order to quickly curb infections or prevent spreading of rumors, first the source of diffusion needs to be localized. We analyze the problem of source localization, based on infection times of a subset of nodes in incompletely observed tree networks, under a simple propagation model. Our scenario reflects the assumption that having access to all the nodes and full network topology is often not feasible. We evaluate the number of possible topologies that are consistent with the observed incomplete tree. We provide a sufficient condition for the selection of observed nodes, such that correct localization is possible, i.e. the network is observable. Finally, we formulate the source localization problem under these assumptions as a binary linear integer program. We then provide a small simulation example to illustrate the effect of the number of observed nodes on the problem complexity and on the number of possible solutions for the source.
Keywords
integer programming; linear programming; network theory (graphs); trees (mathematics); binary linear integer program; diffusion source localization; network observability; network topology; observed node selection; simple propagation model; tree network; Network topology; Observability; Observers; Optimization; Servers; Topology; Vegetation; Network observability; missing edges; source localization; tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European
Conference_Location
Lisbon
Type
conf
Filename
6952849
Link To Document