Title :
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
Author :
Anandkumar, Animashree ; Lang Tong ; Swami, Ananthram ; Ephremides, Anthony
Author_Institution :
ECE Dept., Cornell Univ., Ithaca, NY
Abstract :
The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an optimal statistical-inference test on the correlated measurements, drawn from a Markov random field. Conditioned on the delivery of a sufficient statistic for inference to the fusion center, the structure of optimal routing and fusion is shown to be a Steiner tree on a transformed graph. This Steiner-tree reduction preserves the approximation ratio, which implies that any Sterner- tree approximation can be employed for minimum cost fusion with the same approximation ratio. The proposed fusion scheme involves routing packets of two types viz., raw measurements sent for local processing, and aggregates obtained on combining these processed values. The performance of heuristics for minimum cost fusion are evaluated through theory and simulations, showing a significant saving in routing costs, when compared to routing all the raw measurements to the fusion center.
Keywords :
Markov processes; distributed sensors; random processes; sensor fusion; statistical analysis; telecommunication network routing; trees (mathematics); Markov random field; Steiner tree; distributed sensor fusion; minimum cost data aggregation; multihop routing; statistical inference; Collaborative work; Communications Society; Cost function; Government; Markov random fields; Power generation economics; Routing; Sensor fusion; Statistical distributions; Statistics;
Conference_Titel :
INFOCOM 2008. The 27th Conference on Computer Communications. IEEE
Conference_Location :
Phoenix, AZ
Print_ISBN :
978-1-4244-2025-4
DOI :
10.1109/INFOCOM.2008.129