1. Adaptive Data Aggregation for Wireless Sensor Networks S. Jagannathan Rutledge-Emerson Distinguished Professor Department of Electrical and Computer Engineering Professor of Computer Science Missouri University of Science and Technology Rolla, MO 65409. sarangap@mst.edu 1 Research performed by Priya Kasirajan is thankfully acknowledged

2. Agenda Introduction Background Challenges Proposed Methodology Results and Discussion Hardware results Conclusions and Future work 2

3. Why compression? –Reduction in amount of data transmitted –Reduction in energy consumption –Improvement in network lifetime Compression vs Aggregation –Data condensed at the source node –Aggregation implies data from spatially separated sensors combined statistically using min, avg, max, count, sum –Need location or node ID  Node  Clusterhead Introduction 3

4. Background 4 Survey of data aggregation (Rajagopalan and Varshey, 2006) –Chain based data aggregation, tree based, PEDAP, Grid based, Network flow based, network correlated data aggregation, QoS-aware aggregation Quantization –Lossy compression scheme –Quantization error is proportional to step size –Step size is dependent on dynamic range Adaptive Differential Pulse Code Modulation (ADPCM) –Quantize difference between actual sample and estimated sample –Exploits the correlation between adjacent samples to reduce bit rate and to achieve compression. Real world sensor data with multiple modalities does not always boast correlation and linear relationship

5. Challenges Data compression/aggregation can be a complex nonlinear process Nonlinear processing is computationally more intensive Data reconstruction can be involved –Location aware or context aware –Node ID Performance guarantees in terms of distortion, compression ratio, energy efficiency, hard to show 5

6. Proposed Methodology Channel e(k) Some y(k) Quantizer Estimator Encoder Decoder Estimator

7. Analytical Results Theorem 1 (Estimator-Ideal Performance): In the ideal case with no reconstruction errors and noise present, the estimation error approaches to zero asymptotically while the parameter estimation error vector is bounded. Theorem 2 (Estimator Performance—General Case): Let the hypothesis presented in Theorem 1 hold and if the functional reconstruction error is bounded, then estimation error is bounded while the parameter errors are also bounded.

8. Analytical Results (contd.) Theorem 3 (NADPCMC Distortion): If the estimator reconstruction and quantization errors are considered bounded, then the distortion at the destination is bounded. On the other hand in the absence of estimator reconstruction and quantization errors, the distortion is zero. Theorem 4 (NADPCMC Performance): The compression ratio, defined as the ratio of the amount of uncompressed data to the amount of compressed data, is greater than one. Moreover, the proposed scheme will render energy savings. 8

9. Simulation Results River Discharge Data Audio Data Geophysical Data FLoating point Operations Per Second – FLOPS NADPCMC encoding 7050 FLOPS 1.224 micro joules NADPCMC decoding 7425 FLOPS 1.289 micro joules XBee radio – transmit power – 1 mW for 30 m Energy Consumption

10. River Discharge Data Time

11. River Discharge Data (contd.) 11 Method Compression ratio Energy savings at nodes Energy savings at CH DistortionOverhead Huffman1.453NA31.177%NA480 bytes Differential Huffman1.64221.56%39.099%NA480 bytes Scaling and approximation 1.13713.65%11.65%0.0657%0 Scaling and 9 bit quantization 1.77843.76% 0.943%0 Scaling and 8 bit quantization 2.00050% 2.0685%0 Scaling and5 bit quantization 3.20068.75% 16.451%0 Linear ADPCM250% 13.72%0 NADPCMC with 8 bit encoding 1.945948.61% 2.65%10 bytes NADPCMC with 6 bit encoding 2.548760.76% 6.08%10 bytes

12. Audio Data Time

13. Audio Data (contd.) 13 MethodData rate Compression ratio Energy savings at nodes DistortionOverhead Scaling and 8 bit quantization 64kbps250%10.59%NA Scaling and 6 bit quantization 48kbps2.6762.5%46.28%NA 5 bit linear ADPCM40kbps3.19968.74%11.37%NA 4 bit linear ADPCM32kbps475%23.14%NA 3 bit linear ADPCM24kbps5.33281.25%28.45%NA 2 bit linear ADPCM16kbps887.5%35.86%NA NADPCMC with 8 bit encoding 64kbps1.999249.98%2.04%20 bytes NADPCMC with 6 bit encoding 48kbps2.665362.48%6.16%20 bytes NADPCMC with 4 bit encoding 32kbps3.99774.98%14.44%20 bytes

14. Geophysical Data Performance 14 Time Method Compression ratio Energy savings at nodes DistortionOverhead Scaling and 8 bit quantization 250%4.36%0 Scaling and 6 bit quantization 2.66762.5%13.42%0 Linear ADPCM 250%35.87%0 NADPCMC with 8 bit encoding250%1.02%20 bytes NADPCMC with 6 bit encoding2.66762.5%4.22%20 bytes

15. Aggregation using NADPCMC 8 bit NADPCMC at all source nodes 6 bit NADPCMC at CH 1, 2 and 3 – 61.34% savings – 1.90% 4 bit NADPCMC at CH 1, 2 and 3 – 73.61% savings - 6.10% 4 bit NADPCMC at CH 5 – 74.54% savings – –Synthetic data: 7.01% –River discharge data: 4.83% –Audio data: 6.09% 15

16. Hardware Implementation 16 Compression ratio – 1.846 Energy savings – 45.83% Distortion – 1.67% Compression ratio – 2.526 Energy savings – 60.42% Distortion – 4.60%

17. Nano Sensor Data Performance 17 Data generation rate Transmissio n rate Compress ion ratio Energy savings Distortion Uncompress ed data 2.56 kbps3.424 kbpsNA Compressed data 2.56 kbps1.712 kbps1.875146.67%0.78% for sensor data 0.81% for river discharge data Compressed and aggregated data – 6 bit NADPCMC 2.56 kbps1.284 kbps2.325056.99%3.58% for sensor data 2.78% for river discharge data Compressed and aggregated data – 4 bit NADPCMC 2.56 kbps856 bps3.500271.43%8.21% for sensor data 10.90% for river discharge data

18. Conclusions Data aggregation process is nonlinear and must be location/self-aware for enhanced performance NADPCMC addresses nonlinear issues in data and performs well for different sensor modalities. Aggregation is achieved through iterative compression. Performance depends on number of aggregation levels and Quantizer resolution. Network size does not impact performance. Future work involves evaluation of the proposed scheme for larger size networks with different types of data by considering latency, life time and security