Network-Compressive Coding for Wireless Sensors with Correlated Data

A network-compressive transmission protocol is developed in which correlated sensor observations belonging to a finite alphabet are linearly combined as they traverse the network on their way to a sink node. Statistical dependencies are modeled using factor graphs. The sum-product algorithm is run under different modeling assumptions to estimate the maximum a posteriori set of observations given the compressed measurements at the sink node. Error exponents are derived for cyclic and acyclic factor graphs using the method of types, showing that observations can be recovered with arbitrarily low probability of error as the network size grows. Simulated tests corroborate the theoretical claims.

[1]  Stark C. Draper,et al.  Compressed sensing over finite fields , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[3]  Georgios B. Giannakis,et al.  Distributed In-Network Channel Decoding , 2009, IEEE Transactions on Signal Processing.

[4]  L. Goddard.  Information Theory , 1962, Nature.

[5]  O. F. Cook.  The Method of Types , 1898 .

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  M. Alanyali,et al.  Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links , 2006, IEEE Transactions on Signal Processing.

[8]  Zixiang Xiong,et al.  Distributed source coding for sensor networks , 2004, IEEE Signal Processing Magazine.

[9]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[10]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[11]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[12]  A.S. Willsky,et al.  Distributed fusion in sensor networks , 2006, IEEE Signal Processing Magazine.

[13]  Thomas Schmid,et al.  SensorScope: Experiences with a Wireless Building Monitoring Sensor Network , 2005 .

[14]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[15]  K. Jain,et al.  Practical Network Coding , 2003 .

[16]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Christina Fragouli,et al.  Compressed network coding vectors , 2009, 2009 IEEE International Symposium on Information Theory.

[18]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[19]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 2003, IEEE Trans. Inf. Theory.

[20]  Radford M. Neal.  Pattern Recognition and Machine Learning , 2007, Technometrics.

[21]  Ananthram Swami,et al.  Wireless sensor networks : signal processing and communications perspectives , 2007 .

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

[23]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[24]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[25]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.

[26]  Muriel Medard,et al.  Practical source-network decoding , 2009, 2009 6th International Symposium on Wireless Communication Systems.

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

[28]  Martin J. Wainwright,et al.  Tree-based reparameterization framework for analysis of sum-product and related algorithms , 2003, IEEE Trans. Inf. Theory.

[29]  Ramesh Govindan,et al.  The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.