CaltechAUTHORS
  A Caltech Library Service

Energy Efficient Routing for Statistical Inference of Markov Random Fields

Anandkumar, Animashree and Tong, Lang and Swami, Ananthram (2007) Energy Efficient Routing for Statistical Inference of Markov Random Fields. In: 41st Annual Conference on Information Sciences and Systems. IEEE , Piscataway, NJ, pp. 643-648. ISBN 1-4244-1063-3. https://resolver.caltech.edu/CaltechAUTHORS:20170920-153229570

[img] PDF - Published Version
See Usage Policy.

1MB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170920-153229570

Abstract

The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structure of the MRF is defined by the nearest-neighbor dependency graph, routing schemes which minimize the total energy consumption are analyzed. It is shown that the optimal routing scheme involves data fusion at intermediate nodes and requires transmissions of two types viz., the raw sensor data and the aggregates of log-likelihood ratio (LLR). The raw data is transmitted among the neighbors in the dependency graph and local contributions to the LLR are computed. These local contributions are then aggregated and delivered to the fusion center. A 2-approximation routing algorithm (DFMRF) is proposed and it has a transmission multidigraph consisting of the dependency graph and the directed minimum spanning tree, with the directions toward the fusion center.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/CISS.2007.4298386DOIArticle
http://ieeexplore.ieee.org/document/4298386PublisherArticle
Additional Information:© 2007 IEEE. This work was supported in part through the collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011 and by the National Science Foundation under Contract CNS-0435190. The third author was partially supported by the DARPA ITMANET program. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.
Funders:
Funding AgencyGrant Number
Army Research Laboratory (ARL)DAAD19-01-2-0011
NSFCNS-0435190
Defense Advanced Research Projects Agency (DARPA)UNSPECIFIED
Subject Keywords:Graph theory, Routing, Detection, Markov random fields
DOI:10.1109/CISS.2007.4298386
Record Number:CaltechAUTHORS:20170920-153229570
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170920-153229570
Official Citation:A. Anandkumar, L. Tong and A. Swami, "Energy Efficient Routing for Statistical Inference of Markov Random Fields," 2007 41st Annual Conference on Information Sciences and Systems, Baltimore, MD, 2007, pp. 643-648. doi: 10.1109/CISS.2007.4298386 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4298386&isnumber=4298257
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81646
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:20 Sep 2017 22:41
Last Modified:15 Nov 2021 19:44

Repository Staff Only: item control page