TY - GEN
T1 - Sensor networks for diffusion fields
T2 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
AU - Dokmanić, Ivan
AU - Ranieri, Juri
AU - Chebira, Amina
AU - Vetterli, Martin
PY - 2011
Y1 - 2011
N2 - We consider the problem of reconstructing a diffusion field, such as temperature, from samples collected by a sensor network. Motivated by the fast decay of the eigenvalues of the diffusion equation, we approximate the field by a truncated series. We show that the approximation error decays rapidly with time. On the other hand, the information content in the field also decays with time, suggesting the need for a proper choice of the sampling strategy. We propose two algorithms for sampling and reconstruction of the field. The first one reconstructs the distribution of point sources appearing at known times using the finite rate of innovation (FRI) framework. The second algorithm addresses a more difficult problem of estimating the unknown times at which the point sources appear, in addition to their locations and magnitudes. It relies on the assumption that the sources appear at distinct times. We verify that the algorithms are capable of reconstructing the field accurately through a set of numerical experiments. Specifically, we show that the second algorithm successfully recovers an arbitrary number of sources with unknown release times, satisfying the assumption. For simplicity, we develop the 1-D theory, noting the possibility of extending the framework to more general domains.
AB - We consider the problem of reconstructing a diffusion field, such as temperature, from samples collected by a sensor network. Motivated by the fast decay of the eigenvalues of the diffusion equation, we approximate the field by a truncated series. We show that the approximation error decays rapidly with time. On the other hand, the information content in the field also decays with time, suggesting the need for a proper choice of the sampling strategy. We propose two algorithms for sampling and reconstruction of the field. The first one reconstructs the distribution of point sources appearing at known times using the finite rate of innovation (FRI) framework. The second algorithm addresses a more difficult problem of estimating the unknown times at which the point sources appear, in addition to their locations and magnitudes. It relies on the assumption that the sources appear at distinct times. We verify that the algorithms are capable of reconstructing the field accurately through a set of numerical experiments. Specifically, we show that the second algorithm successfully recovers an arbitrary number of sources with unknown release times, satisfying the assumption. For simplicity, we develop the 1-D theory, noting the possibility of extending the framework to more general domains.
KW - Diffusion field
KW - estimation
KW - release time
KW - sensor networks
KW - source localization
KW - sparse sampling
UR - http://www.scopus.com/inward/record.url?scp=84856104309&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856104309&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2011.6120352
DO - 10.1109/Allerton.2011.6120352
M3 - Conference contribution
AN - SCOPUS:84856104309
SN - 9781457718168
T3 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
SP - 1552
EP - 1558
BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Y2 - 28 September 2011 through 30 September 2011
ER -