doi:10.1016/j.endm.2015.07.012
Celis, Elisa
Pavetic, Filip
Spinelli, Brunella Marta
Thiran, Patrick
Budgeted sensor placement for source localization on trees
http://infoscience.epfl.ch/record/220673/files/1-s2.0-S1571065315001675-main.pdf
http://infoscience.epfl.ch/record/220673/files/extended.pdf
We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex resolvability. For the case of tree graphs we give polynomial time algorithms for both finding the sensors that maximize the probability of correct detection of the source and for identifying the sensor set that minimizes the expected distance between the real source and the estimated one.
2016-08-10T09:21:13Z
http://infoscience.epfl.ch/record/220673
http://infoscience.epfl.ch/record/220673