© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Kriging.
© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Pedro Santos Traian Abrudan Ana.
Onur G. Guleryuz & Ulas C.Kozat DoCoMo USA Labs, San Jose, CA 95110
Lab 2 Lab 3 Homework Labs 4-6 Final Project Late No Videos Write up
Belief Propagation by Jakob Metzler. Outline Motivation Pearl’s BP Algorithm Turbo Codes Generalized Belief Propagation Free Energies.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
CS774. Markov Random Field : Theory and Application Lecture 04 Kyomin Jung KAIST Sep
1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Volkan Cevher, Marco F. Duarte, and Richard G. Baraniuk European Signal Processing Conference 2008.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Distributed Regression: an Efficient Framework for Modeling Sensor Network Data Carlos Guestrin Peter Bodik Romain Thibaux Mark Paskin Samuel Madden.
Spatial and Temporal Data Mining
Location Estimation in Sensor Networks Moshe Mishali.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Dimension reduction : PCA and Clustering Slides by Agnieszka Juncker and Chris Workman.
Phylogenetic Trees Presenter: Michael Tung
On the interdependence of routing and data compression in multi-hop sensor networks Anna Scaglione, Sergio D. Servetto.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
BASiCS Group University of California at Berkeley Generalized Coset Codes for Symmetric/Asymmetric Distributed Source Coding S. Sandeep Pradhan Kannan.
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Review Rong Jin. Comparison of Different Classification Models  The goal of all classifiers Predicating class label y for an input x Estimate p(y|x)
Radial Basis Function Networks
Signal Strength based Communication in Wireless Sensor Networks (Sensor Network Estimation) Imran S. Ansari EE 242 Digital Communications and Coding (Fall.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
CS774. Markov Random Field : Theory and Application Lecture 08 Kyomin Jung KAIST Sep
Efficient Gathering of Correlated Data in Sensor Networks
The Minimal Communication Cost of Gathering Correlated Data over Sensor Networks EL 736 Final Project Bo Zhang.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
CSIE Dept., National Taiwan Univ., Taiwan
© 2005, it - instituto de telecomunicações. Todos os direitos reservados. J.Almeida, J.Barros Instituto de Telecomunicações Universidade do Porto Joint.
Populations, Samples, & Data Summary in Nat. Resource Mgt. ESRM 304.
Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun Kim Data Communication and Data Management.
Dimension reduction : PCA and Clustering Slides by Agnieszka Juncker and Chris Workman modified by Hanne Jarmer.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Introduction to Digital Signals
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
Optimal Sampling Strategies for Multiscale Stochastic Processes Vinay Ribeiro Rolf Riedi, Rich Baraniuk (Rice University)
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
CS Statistical Machine learning Lecture 24
The Restricted Matched Filter for Distributed Detection Charles Sestok and Alan Oppenheim MIT DARPA SensIT PI Meeting Jan. 16, 2002.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Lecture 2: Statistical learning primer for biologists
Clustering Instructor: Max Welling ICS 178 Machine Learning & Data Mining.
DISTIN: Distributed Inference and Optimization in WSNs A Message-Passing Perspective SCOM Team
Exact Inference in Bayes Nets. Notation U: set of nodes in a graph X i : random variable associated with node i π i : parents of node i Joint probability:
A Low-Complexity Universal Architecture for Distributed Rate-Constrained Nonparametric Statistical Learning in Sensor Networks Avon Loy Fernandes, Maxim.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
Presented by: Dardan Xhymshiti Spring 2016:. Authors: Publication:  ICDM 2015 Type:  Research Paper 2 Michael ShekelyamGregor JosseMatthias Schubert.
Rate Distortion Theory. Introduction The description of an arbitrary real number requires an infinite number of bits, so a finite representation of a.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
Distributed cooperation and coordination using the Max-Sum algorithm
LECTURE 11: Advanced Discriminant Analysis
LECTURE 09: BAYESIAN ESTIMATION (Cont.)
Ch3: Model Building through Regression
On Optimal Distributed Kalman Filtering in Non-ideal Situations
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
Foundation of Video Coding Part II: Scalar and Vector Quantization
Dimension reduction : PCA and Clustering
LECTURE 15: REESTIMATION, EM AND MIXTURES
Presentation transcript:

© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT Workshop June 1st 2010, Porto, Portugal Universidade do Porto, Portugal

2 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Motivation – Wireless Sensor Network Scenario Task: Collect and Transmit Data about Physical Process Constraints: Energy Processing Power Memory, etc. Properties: Correlated Sources Several Sinks Communication Network Source Coding Problem Communication/ Network Aspect Complexity Issue

3 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Part I: Low-Complexity Distributed Source Coding Source Coding Problem Complexity Issue

4 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 System Model – Source correlated Gaussian sources Vector of the source observations (samples) Joint probability distribution is given by with known Covariance matrix and the vector of mean values Two correlated Gaussian Sources:

5 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 System Model – Quantizer Encoder : Scalar quantizer (block ) maps the continuous-valued source samples onto discrete-valued indices Quantizer: Optimized for the statistics of the observation Simple and low delay

6 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 System Model – Mapping Mapping function: Simple surjective mapping (block ) from quantization indices onto codewords Number of codewords smaller than number of indices Reduced data rate from [bit/sample] to [bit/sample] Increased distortion Encoder :

7 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Complexity of optimal decoding is of System Model – Decoder Decoder uses the vector of received codewords and the source statistics to form estimates of the source samples Fidelity criterion is the mean squared error Optimal decoder given by conditional mean estimator

8 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Considered Problem Setup – Large Scale Sensor Network sensors uniformly distributed in a unit square Correlation of sensors measurements decreases exponentially with Euclidean distance Example:

9 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Maximum Clustersize : Source Optimized Clustering Code design not feasible for large number of sources Distributed data compression works (well) with strong correlations Find clusters with small number of encoders and strong correlations, where Use hierarchical clustering algorithm such that and are as similar as possible, i.e. minimize KLD Motivation: Approach: Goal:

10 Optimal decoder that uses exact source statistics is not feasible Suboptimal decoder can be tailored for approximated source statistics (factor graph + sum-product algorithm) Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010PhD Seminar, December 2nd 2009 Source Model for Efficient Decoding Find factorization such that similarity between and is maximized, i.e. minimize KLD Account for cluster statistics Directed spanning tree algorithm can be used to do that Motivation: Approach: Goal:

11 Optimal decoding requires marginalization Marginalization can be performed efficiently using the sum-product algorithm Sum-product algorithm runs on factor-graph describing the factorization of Idea: Perform global marginalization via local ones Low complexity Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 An Iterative Decoding Approach and its Complexity number of nodes degree of function nodes maximum alphabet size iteration constant Decoding Complexity No cycles: Cycles: Only linear dependency on number of nodes Exponential dependency on node degree

12 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Part II: Diophantine Index Assignments for Distributed Source Coding Source Coding Problem

13 IT Workshop, June 1st 2010 Different properties! Intuition/ Key Idea Periodical cicadas Plant feeding insect Spend most of their live below ground Emerge synchronized to breed Live cycle is periodic and a prime number of years (species with 5, 7,13,17 years) Species compete for the same food and want to avoid each other Example 1:Example 2: Diophantine equation Equation for solutions: PhD Seminar, December 2nd 2009 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher

14 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Distributed source coding based on Diophantine index-assignments Properties: Characterized by parameter Goal: Jointly find to minimize decoding errors (distortion) Diophantine Index-Assignments Example: Let be the number of codewords, then all indices are mapped onto the same codeword i.e..

15 And it actually works... Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010

16 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Part III: Joint Source-Network Coding Communication/ Network Aspect

17 Joint Source-Network Coding Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Example: Given the statistical representation of the system components, construct a statistical model for decoding Decoding model contains both source and network components Factor graph representation for iterative decoding Goal: 2 Step approach

18 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Decoding Model (Step 1) - Modelling the Packet’s Path Decoding model at node after receiving message Packet path Model of packet path (full model) Constructed Decoding Model

19 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Decoding Model (Step 1) - Modelling the Packet’s Path Decoding model at node after receiving message, Packet path Model of packet path (full model) Constructed Decoding Model

20 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Decoding Model (Step 1) - Modelling the Packet’s Path Decoding model at node after receiving message,, Packet path Model of packet path (full model) Constructed Decoding Model

21 Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Decoding Model (Step 2) – Adding the Source Model Source model Full decoding model Combined packet models for,, Decoding Complexity still No cycles: Cycles:

22 Future Work Scalable Coding Solutions for Wireless Sensor Networks, G. Maierbacher IT Workshop, June 1st 2010 Compare low-complexity distributed source coding approach with other work (DISCUS, etc.) Conduct large-scale experiments with large number of sources for the network coding case Consider quantization with memory (TCQ) Incorporate mappings with memory (e.g. trellis based approaches) Thank you!