Energy Efficient Routing for Statistical Inference of Markov Random Fields

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.

[1]  J. M. Hammersley,et al.  Markov fields on finite graphs and lattices , 1971 .

[2]  J. Besag.  Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[3]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[4]  Pierre A. Humblet.  A Distributed Algorithm for Minimum Weight Directed Spanning Trees , 1983, IEEE Trans. Commun..

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Xavier Guyon,et al.  Random fields on a network , 1995 .

[9]  L. Baxter.  Random Fields on a Network: Modeling, Statistics, and Applications , 1996 .

[10]  David Eppstein,et al.  On Nearest-Neighbor Graphs , 1992, ICALP.

[11]  Michael I. Jordan.  Graphical Models , 2003 .

[12]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[13]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .

[14]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[15]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[16]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[17]  Anna Scaglione,et al.  On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks , 2002, MobiCom '02.

[18]  Anthony Ephremides,et al.  Energy concerns in wireless networks , 2002, IEEE Wirel. Commun..

[19]  Deborah Estrin,et al.  Impact of network density on data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[20]  Kannan Ramchandran,et al.  A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Deborah Estrin,et al.  Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.

[22]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[23]  Guohong Cao,et al.  Optimizing tree reconfiguration for mobile target tracking in sensor networks , 2004, IEEE INFOCOM 2004.

[24]  Roger Wattenhofer,et al.  Gathering correlated data in sensor networks , 2004, DIALM-POMC '04.

[25]  Jun Luo,et al.  Energy efficient routing with adaptive data fusion in sensor networks , 2005, DIALM-POMC '05.

[26]  A.S. Willsky,et al.  An approximate dynamic programming approach to a communication constrained sensor management problem , 2005, 2005 7th International Conference on Information Fusion.

[27]  Alan S. Willsky,et al.  Inference with Minimal Communication: a Decision-Theoretic Variational Approach , 2005, NIPS.

[28]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

[29]  Roger Wattenhofer,et al.  Network correlated data gathering with explicit communication: NP-completeness and algorithms , 2006, IEEE/ACM Transactions on Networking.

[30]  Panganamala Ramana Kumar,et al.  Toward a theory of in-network computation in wireless sensor networks , 2006, IEEE Communications Magazine.

[31]  Pramod K. Varshney,et al.  Data-aggregation techniques in sensor networks: a survey , 2006, IEEE Communications Surveys & Tutorials.

[32]  Ananthram Swami,et al.  Detection of Gauss-Markov Random Field on Nearest-Neighbor Graph , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[33]  Ananthram Swami,et al.  Detection of Gauss–Markov Random Fields With Nearest-Neighbor Dependency , 2007, IEEE Transactions on Information Theory.