Advanced Metrology Lab., Texas A&M University Collaborative data reduction for sensor power efficiency Aug. 25, 2008 by Chiwoo Park.

Slides:



Advertisements
Similar presentations
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
Advertisements

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Sensor network Routing protocol A study on LEACH protocol and how to improve it.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
CSE 5392By Dr. Donggang Liu1 CSE 5392 Sensor Network Security Introduction to Sensor Networks.
Song Han, Xiuming Zhu, Al Mok University of Texas at Austin
Intraship Integration Control Instructor: TV Prabakar.
Wireless Sensor Networks: Perimeter Security By Jeremy Prince, Brad Klein, Brian Wang, & Kaustubh Jain.
Cooperative Multiple Input Multiple Output Communication in Wireless Sensor Network: An Error Correcting Code approach using LDPC Code Goutham Kumar Kandukuri.
1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.
Psychology 202b Advanced Psychological Statistics, II February 22, 2011.
Linear Methods for Regression Dept. Computer Science & Engineering, Shanghai Jiao Tong University.
An Adaptive Data Forwarding Scheme for Energy Efficiency in Wireless Sensor Networks Christos Anagnostopoulos Theodoros Anagnostopoulos Stathes Hadjiefthymiades.
1 In-Network PCA and Anomaly Detection Ling Huang* XuanLong Nguyen* Minos Garofalakis § Michael Jordan* Anthony Joseph* Nina Taft § *UC Berkeley § Intel.
Context Compression: using Principal Component Analysis for Efficient Wireless Communications Christos Anagnostopoulos & Stathes Hadjiefthymiades Pervasive.
Low Power Design for Wireless Sensor Networks Aki Happonen.
Overview.  UMTS (Universal Mobile Telecommunication System) the third generation mobile communication systems.
Aggregation in Sensor Networks NEST Weekly Meeting Sam Madden Rob Szewczyk 10/4/01.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Chapter 15: Model Building
RACE: Time Series Compression with Rate Adaptivity and Error Bound for Sensor Networks Huamin Chen, Jian Li, and Prasant Mohapatra Presenter: Jian Li.
Dan Simon Cleveland State University
Energy Conservation in wireless sensor networks Kshitij Desai, Mayuresh Randive, Animesh Nandanwar.
Radio-Triggered Wake-Up Capability for Sensor Networks Soji Sajuyigbe Duke University Slides adapted from: Wireless Sensor Networks Power Management Prof.
Ensemble Learning (2), Tree and Forest
MICA: A Wireless Platform for Deeply Embedded Networks
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Database Performance Tuning and Query Optimization.
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
RT-Link: A Time-Synchronized Link Protocol for Energy-Constrained Multi- hop Wireless Networks Anthony Rowe, Rahul Mangharam and Raj Rajkumar CMU SECON.
Resilient Peer-to-Peer Streaming Presented by: Yun Teng.
Advanced Metrology Lab., Texas A&M University Goal-oriented wavelet data reduction and the application to smart infrastructure Jun. 1, 2009 by Chiwoo Park.
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
SENSOR NETWORKS BY Umesh Shah Mayuresh Patil G P Reddy GUIDES Prof U.B.Desai Prof S.N.Merchant.
Constraint Satisfaction CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Secure In-Network Aggregation for Wireless Sensor Networks
Network Technologies Definitions –Network: physical connection that allows two computers to communicate –Packet: a unit of transfer »A sequence of bits.
Advancing Wireless Link Signatures for Location Distinction Mobicom 2008 Junxing Zhang, Mohammad H. Firooz Neal Patwari, Sneha K. Kasera University of.
Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
By: Gang Zhou Computer Science Department University of Virginia 1 Medians and Beyond: New Aggregation Techniques for Sensor Networks CS851 Seminar Presentation.
© 2002 IBM Corporation IBM Research 1 Policy Transformation Techniques in Policy- based System Management Mandis Beigi, Seraphin Calo and Dinesh Verma.
MACHINE LEARNING 7. Dimensionality Reduction. Dimensionality of input Based on E Alpaydın 2004 Introduction to Machine Learning © The MIT Press (V1.1)
Simulation of DeReClus Yingyue Xu September 6, 2003.
Tianyang Wang Tianxiong Yang Advanced Computer Networks Fall 2014 Modification of STC Algorithm.
An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks Jaehyun Kim, Dept. of Electrical & Electronic Eng., Yonsei University;
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling.
Wireless Sensor Networks
Distributed cooperation and coordination using the Max-Sum algorithm
Energy Efficient Data Management in Sensor Networks Sanjay K Madria Web and Wireless Computing Lab (W2C) Department of Computer Science, Missouri University.
Building Wireless Efficient Sensor Networks with Low-Level Naming J. Heihmann, F.Silva, C. Intanagonwiwat, R.Govindan, D. Estrin, D. Ganesan Presentation.
Tree and Forest Classification and Regression Tree Bagging of trees Boosting trees Random Forest.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Structured parallel programming on multi-core wireless sensor networks Nicoletta Triolo, Francesco Baldini, Susanna Pelagatti, Stefano Chessa University.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
LECTURE 14: DIMENSIONALITY REDUCTION: PRINCIPAL COMPONENT REGRESSION March 21, 2016 SDS 293 Machine Learning B.A. Miller.
Data Transformation: Normalization
Computing and Compressive Sensing in Wireless Sensor Networks
Outlier Processing via L1-Principal Subspaces
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Energy Efficient Scheduling in IoT Networks
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Advanced Metrology Lab., Texas A&M University Collaborative data reduction for sensor power efficiency Aug. 25, 2008 by Chiwoo Park

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, A Bridge Manager’s problem Frequent sensor replacement can be enormous cost to a bridge manager. How can we increase the lifetime of sensors? The lifetime of bridge is 50 years… The lifetime of sensors’ battery is around 0.5 years 100 times sensor replacements!! Thousands of sensors over a bridge $$$ ??

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Possible solutions within sensors Right now, possible solutions are reducing data processing or data transmission. Adjust sampling frequency Replace with energy- efficient sensors Data processing Center X Conceptual diagram of a micro-sensor Micro-sensorMicro-processorMicro-Radio Micro-battery Reduce data processing Replace with energy- efficient processors Reduce data transmission Replace with energy- efficient radio units Area of Interest Increase capacity of batteries X X X X Trade-off

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, And, he found.. Data reduction on a sensor gives an opportunity to prolong the lifetime of the sensor. Processor Power Consumption ProcessorActive modeSleep mode ATMega 128 (MicaZ)4nJ/instr30μW PXA255(Stargate)1.1nJ/instr20mW Radio Power Consumption Radio moduleTransmission CC2420 Zigbee Radio (MicaZ)430nJ/bit Radio (Stargate)90nJ/bit Fact sheet about a sensor 2 x 2850 mAh X 1.5 V = mWh = J Batteries’ capacity ( 2 x AA Batteries) Batteries’ lifetime (MicaZ case) Config.ProcessorRadioTotal A0 mJ430 mJ B4 mJ43 mJ47 mJ Sense Data redu ction 1) Transmit 2) Configuration B (Lifetime: 934 days) 1) 10 6 instr / min 2) 10 5 bits / min Sense Transmit 2) Configuration A (Lifetime: 102 days) 2) 10 6 bits / min Power Consumption / min

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Manager’s approach The approach is known as “In-network data aggregation” Leaf 1Leaf Leaf m P-7P-6P-5P-4 P-3P-2P-1P X1X1 X2X2 XmXm A1A1A2A2 A3A4 A5A6 A7A8 Intermediate 1

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Time delay matters… As the network structure gets complicated, the time delay for propagating data also increases Leaf 1Leaf 2 X1X1 X2X Leaf 3Leaf 4 X3X3 X4X Intermediate 1Intermediate 2 A1A1A2A2 A3A4 A5A6 A7A8 A9A10 A11A12 A13A14 A15A16 B1B1B2B2 B3B4 B5B6 B7B8 Central Repository 10 sec15 sec12 sec 17 sec sec17+23 sec Total Propagation Delay = 40 sec. * The picture is from the site,

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Good Thought Reduce data transmission more and remove the propagation delay. Leaf 1Leaf 2 X1X1 X2X2 Leaf 3Leaf 4 X3X3 X4X4 Intermediate 1Intermediate 2 B1B1 B2 B5B7 B6B8 Central Repository 12 sec17 sec14 sec 19 sec 12+5 sec 19+5 sec How about this (MAX DELAY= 24 sec.) B3 B4 B5 B6 B7 B8 B1B1B3 B2B sec 14+5 sec No wait Leaf 1Leaf 2 X1X1 X2X2 Leaf 3Leaf 4 X3X3 X4X4 Intermediate 1Intermediate 2 A1A1A2A2 A3A4 A5A6 A7A8 A9A10 A11A12 A13A14 A15A16 B1B1B2B2 B3B4 B5B6 B7B8 Central Repository 10 sec15 sec12 sec 17 sec sec sec Current (MAX DELAY= 40 sec.) Wait for Arrivals

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Difficulties How can we make both types of data reduction simultaneously on leaf nodes? Data sharing among sensors requires additional data transmissions. Peer-to-Peer (P2P) Data Sharing Additional Communication burden… Sensor’s memory: only 4KB Data RAM 512KB Flash memory

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Our method: overview Our method consists of periodic collaboration and data aggregation. 1. Forward Collaboration 2. Backward Collaboration3. Data aggregation Phase 1: Collaboration (Periodic)Phase 2: Data reduction Leaf Leaf 2Leaf Central Repository Central Repository Leaf Leaf 2Leaf Analysis and Decision Central Repository Leaf 1Leaf 2Leaf {1,4,6}{9,15}{22,23} Indices of the chosen

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Local data reduction Global data reduction Forward Collaboration in detail After tree-based collaboration, we can identify the minimal set of data to be transferred Leaf 1Leaf 2 X1X1 X2X2 Leaf 3Leaf 4 X3X3 X4X4 Intermediate 1Intermediate 2 A1A1A2A2 A3A4 A5A6 A7A8 A9A10 A11A12 A13A14 A15A16 A1A1A6 A2A8 A9A14 A15A12 Central Repository A1 A2 A3 Wavelet Transform PCA (Principal Component Analysis) 1.2 Projection-based data reduction A1 A2 Ridge Regression Lasso Regression Principal Variable A4 A1 A2 A3 A4 1.1 Variable selection (Subset selection) A1A6 A15A8 No dependent variable

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Formulation for variable selection For aggressive data reduction, we added the number of the selected elements as a penalty term to the original objective function of “principal variable” method. Key Idea Partial covariance matrix of T given S is a measure of the variation that cannot be captured by S. If the total sum of eigenvalues of is smaller, T is close to be deterministic given S. Find T and S so as to minimize Formulation where If the partial covariance is enough small, T is highly dependent of S. That is, If we know only S, we can almost determine T. A1 A2 A1 A2 A3 A4 S (Selected) T (Not selected)

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Solution Procedure for variable selection: Iterative greedy search Iteration1: Initial Settings S= Empty set T= Generate Subsets 1 SUBSET 1 = 2 SUBSET 2 = 3 SUBSET 3 = 7 SUBSET 7 = 6 SUBSET 6 = 5 SUBSET 5 = 4 SUBSET 4 = Evaluate each subset Evaluate the criterion for each subset generated C(SUBSET 1) =0.64 C(SUBSET 2) = 0.42 C(SUBSET 3) = 0.35 C(SUBSET 4) = 0.41 C(SUBSET 5) = 0.51 C(SUBSET 6) = 0.20 C(SUBSET 7) = 0.17 Choose the best subset S= SUBSET 1 = T = Iteration1: Initial Settings S = Empty set T= Generate Subsets 1 SUBSET 1 = 2 SUBSET 2 = 3 SUBSET 3 = 7 SUBSET 7 = 6 SUBSET 6 = 5 SUBSET 5 = 4 SUBSET 4 = Evaluate each subset Evaluate the objective value for each subset generated C(SUBSET 1) =0.11 C(SUBSET 2) = 0.42 C(SUBSET 3) = 0.35 C(SUBSET 4) = 0.41 C(SUBSET 5) = 0.51 C(SUBSET 6) = 0.20 C(SUBSET 7) = 0.17 Choose the best subset S= SUBSET 1 = T = Iteration 2: Initial Settings S= T= Generate Subsets 1 SUBSET 1 = 1 SUBSET 2 = 1 SUBSET 3 = 1 SUBSET 6 = 1 SUBSET 5 = 1 SUBSET 4 = Evaluate each subset Evaluate the criterion for each subset generated C(SUBSET 1) = 0.88 C(SUBSET 2) = 0.76 C(SUBSET 3) = 0.69 C(SUBSET 4) =0.92 C(SUBSET 5) = 0.82 C(SUBSET 6) = 0.79 Choose the subset of the biggest criterion value S = SUBSET 4 = T= Iteration 2: Initial Settings S= T= Generate Subsets 1 SUBSET 1 = 1 SUBSET 2 = 1 SUBSET 3 = 1 SUBSET 6 = 1 SUBSET 5 = 1 SUBSET 4 = Evaluate each subset Evaluate the objective value for each subset generated C(SUBSET 1) = 0.11 C(SUBSET 2) = 0.10 C(SUBSET 3) = 0.09 C(SUBSET 4) =0.06 C(SUBSET 5) = 0.11 C(SUBSET 6) = 0.10 S = SUBSET 4 = T= Example Add one from T to S Choose the best subset

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Case study: real data We split a signal into 14 subgroups to represent multi-sensor data. 224 data points per cycle amplitude 528 sample signals from normal structure 378 sample signals from abnormal structure Signal sampling from a vibration sensor Randomly split to 14 subgroups Sensor 1 Sensor 2 Sensor data points

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Comparison of three configurations For comparison, we setup the following three experiment configurations. Central repositoryCentral repository (PCA)Central repository (No reduction) I: No data reductionII: In-network data aggregationIII: Our method Highest data reduction capability No information loss No time delay High data reduction Little information loss

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Results Our method reduced the amount of data transmissions while it kept most of the features required to detect process faults. Data reduction rateInformation preserving capabilities The original dimension = 224 Our method reduced to 5.1 (on average) dimensions against 15.6 dimensions of individual sensor-based reduction. Our method’s fault detection errors are the best in False Alarm, similar to the best in Miss Detection. Our method are keeping important features with relatively small data transmission. Configuration Data reduction rate Amount of data transmission False AlarmMiss detection I. No data reduction II. In-network data aggregation 99.55% III. Our method 97.72%

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Summary The major benefits from our method include high power efficiency of sensor’s operation and responsiveness to the outside changes. Tree-based collaboration Apply different types of data reduction methods for leaves and intermediates New collaborative data reduction Reduce all data redundancy on leaves Do nothing on intermediates No propagation time delay Higher data reduction degree than local data reduction Less communication burden for collaboration Periodic execution of collaboration phase Separate collaboration from data reduction

Advanced Metrology Lab., Texas A&M UniversityPresented by Chiwoo Park on Aug. 25, Thank you for attention.