Distributed Statistical Inference using Type Based Random Access - PowerPoint PPT Presentation

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Statistical Inference using Type Based Random Access over Multi-access Fading Channels Animashree Anandkumar and Lang Tong Adaptive Communication and Signal Processing Group School of Electrical and Computer Engineering Cornell University, Ithaca, NY 14853. Supported by the MURI under Office of Naval Research and Army Research Laboratory CTA 03/22/2006. Anima Kumar at CISS ’06 1 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Classical Distributed Inference Node n Node 2 Node 1 • Sensors : Sense physical phenomenon and transmit their local decisions. � � � � � � � � � � � � � � � � • Fusion Center: Make inference on the �� phenomenon. �� C n C 1 C 2 �� • Sensor-Fusion Center Communication �� Perfect (Error - free) with rate constraints. �� • Typically in Radar communication. Fusion Center Key Issues • Quantization @ sensors. • Inference @ fusion center. Anima Kumar at CISS ’06 2 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Inference in Large Wireless Sensor Networks Characteristics • Low Power and Low Rate Transmissions. • Bandwidth Allocation. Mobile Access • Multiaccess Channel with Fading. • Energy Efficiency to prolong network life-time. • Faulty, sleeping or poorly placed sensors. • Deterministic scheduling (TDMA) may Cluster head not be appropriate. Medium Access Design is a key component. Anima Kumar at CISS ’06 3 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Random Access • Model : Random Number of Sensors in a data collection. • Probabilistic Wake-up : Transmit based on a coin-flip. • Transmit only Significant Data. • Fusion center is a Mobile Access Point : collects data from different geographic regions. Anima Kumar at CISS ’06 4 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Inference over Multi-Access Channels Detection ( Binary Hypothesis) and Estimation. Physical Phenomenon Random number of sensors per collection θ ∈ Θ N i are IID with mean λ . Sensor Quantization: X i,j quantized to M levels Sensor Sensor Sensor and Conditionally IID given θ 1 2 n X ij ∼ p θ = ( p θ (1) , · · · , p θ ( M )) Multi-access model • Flat IID fading: H i,j • AWGN W ( t ) with PSD = σ 2 . Inference at Fusion Center • Neyman Pearson or Bayesian Detection. • Maximum Likelihood Estimation. Multiple collections: i –time index, j –sensor index. Anima Kumar at CISS ’06 5 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Inference over Multi-Access Channels Detection ( Binary Hypothesis) and Estimation. Physical Phenomenon Random number of sensors per collection θ ∈ Θ N i are IID with mean λ . Sensor Quantization: X i,j quantized to M levels Sensor Sensor Sensor and Conditionally IID given θ 1 2 n X i, 2 X i, 1 X i,n i X ij ∼ p θ = ( p θ (1) , · · · , p θ ( M )) Multi-access model • Flat IID fading: H i,j • AWGN W ( t ) with PSD = σ 2 . Inference at Fusion Center • Neyman Pearson or Bayesian Detection. • Maximum Likelihood Estimation. Multiple collections: i –time index, j –sensor index. Anima Kumar at CISS ’06 5 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Inference over Multi-Access Channels Detection ( Binary Hypothesis) and Estimation. Physical Phenomenon Random number of sensors per collection θ ∈ Θ N i are IID with mean λ . Sensor Quantization: X i,j quantized to M levels Sensor Sensor Sensor and Conditionally IID given θ 1 2 n X i, 2 X i, 1 X i,n i X ij ∼ p θ = ( p θ (1) , · · · , p θ ( M )) Multi-access model Multiaccess Channel Noise W • Flat IID fading: H i,j • AWGN W ( t ) with PSD = σ 2 . Y i Inference at Fusion Center • Neyman Pearson or Bayesian Detection. • Maximum Likelihood Estimation. Multiple collections: i –time index, j –sensor index. Anima Kumar at CISS ’06 5 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Inference over Multi-Access Channels Detection ( Binary Hypothesis) and Estimation. Physical Phenomenon Random number of sensors per collection θ ∈ Θ N i are IID with mean λ . Sensor Quantization: X i,j quantized to M levels Sensor Sensor Sensor and Conditionally IID given θ 1 2 n X i, 2 X i, 1 X i,n i X ij ∼ p θ = ( p θ (1) , · · · , p θ ( M )) Multi-access model Multiaccess Channel Noise W • Flat IID fading: H i,j • AWGN W ( t ) with PSD = σ 2 . Y i Detector / Estimator Inference at Fusion Center ˆ θ Fusion Center • Neyman Pearson or Bayesian Detection. • Maximum Likelihood Estimation. Multiple collections: i –time index, j –sensor index. Anima Kumar at CISS ’06 5 / 27

Type Based Random Access Performance Metric Optimal TBRA Conclusion Spatio-Temporal Tradeoff • Mean Transmitting Rate λ and Number of Data Collections l . • Suppose we fix mean number of transmissions is ρ ∆ = λl , (proportional to energy budget). Number of collections l • Should energy be allocated to simultaneous transmissions : large λ ? • Or should we collect more data : large l ? ρ = λl • Small λ : not enough sensors transmit , cannot counter noise. • But, large λ : Less Observations as l is small. Transmission Rate λ • Role of multi access channel : Coherence or Cancelation ? Anima Kumar at CISS ’06 6 / 27

Distributed Statistical Inference using Type Based Random Access - PowerPoint PPT Presentation

Type Based Random Access Performance Metric Optimal TBRA Conclusion Distributed Statistical Inference using Type Based Random Access over Multi-access Fading Channels Animashree Anandkumar and Lang Tong Adaptive Communication and Signal

UQ, STAT2201, 2017, Lecture 6 Unit 6 Statistical Inference Ideas. 1 Statistical Inference is

Random projections, reweighting and half-sampling for high-dimensional statistical inference Art

On Statistical Inference of Spatio-Temporal Random Fields Yoshihiro Yajima and Yasumasa Matsuda

Type Inference 75 Definition Type Inference Type inference = Java compiler's ability

Inference Statistical inference Definition: Definition: The act or process of reaching

Scalable Algorithms for Distributed Statistical Inference Animashree Anandkumar School of

Probability Distributions and Introduction to Statistical Inference BIO5312 FALL2017 STEPHANIE

Chapter 4: Multiple Random Variables STK4011/9011: Statistical Inference Theory Johan Pensar

Energy Efficient Routing for Statistical Inference of Markov Random Fields A. Anandkumar 1 L. Tong

Statistical Inference Definition : A model is a family { P ; } of possible

Modes of Statistical Inference for Causal Efgects Plus an overview of the testing based approach

Samples and Statistics The objective of statistical inference is to draw conclusions or make

Hindley-Milner Type Checking Automatic Type Inference What can be inferred about type of f or x

Foundations for Inference I Dajiang Liu @PHS525 Feb-09-2016 Statistical Inference

Introduction to Statistical Inference Edwin Leuven Introduction Define key terms that are

Probability, Entropy, and Inference Ensemble X is a triple ( x, A X , P X ) , where Based on

A NEW TOOL FOR COMPARING ADAPTIVE DESIGNS; A POSTERIORI EFFICIENCY Jos e A. Moler, Universidad

Sampling Techniques Department of Political Science and Government Aarhus University September

Data Mining Ian H. Witten The problem Data Mining with Weka Classification (supervised)

ETC5510: Introduction to Data Analysis ETC5510: Introduction to Data Analysis Week 7, part B

Outline A taxonomy of CR security threats Primary user emulation attacks Cognitive Radio

Neyman-Pearson Given a sample x 1 , x 2 , ..., x n , from a More Motifs distribution f(...|

Welcome and First Lecture Department of Government London School of Economics and Political

Pattern Recognition. Bayesian and non-Bayesian Tasks. Petr Po s k This lecture is based