Demetrios Zeinalipour-Yazti (Univ. of Cyprus)

Slides:



Advertisements
Similar presentations
Is There Light at the Ends of the Tunnel? Wireless Sensor Networks for Adaptive Lighting in Road Tunnels IPSN 2011 Sean.
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.
IN-NETWORK VS CENTRALIZED PROCESSING FOR LIGHT DETECTION SYSTEM USING WIRELESS SENSOR NETWORKS Presentation by, Desai, Bhairav Solanki, Arpan.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
1 MobiQuery: A Spatiotemporal Query Service for Mobile Users in Sensor Networks Chenyang Lu, Guoliang Xing, Octav Chipara Chien-Liang Fok, and Sangeeta.
Towards a Network-aware Middleware for Wireless Sensor Networks University of Cyprus Department of Computer Science Panayiotis G. Andreou, Demetrios Zeinalipour-Yazti,
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Context Compression: using Principal Component Analysis for Efficient Wireless Communications Christos Anagnostopoulos & Stathes Hadjiefthymiades Pervasive.
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams Amit Manjhi, Suman Nath, Phillip B. Gibbons Carnegie Mellon University.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
On the Energy Efficient Design of Wireless Sensor Networks Tariq M. Jadoon, PhD Department of Computer Science Lahore University of Management Sciences.
SIGMOD'061 Energy-Efficient Monitoring of Extreme Values in Sensor Networks Adam Silberstein Kamesh Munagala Jun Yang Duke University.
Model-driven Data Acquisition in Sensor Networks Amol Deshpande 1,4 Carlos Guestrin 4,2 Sam Madden 4,3 Joe Hellerstein 1,4 Wei Hong 4 1 UC Berkeley 2 Carnegie.
CS 580S Sensor Networks and Systems Professor Kyoung Don Kang Lecture 7 February 13, 2006.
Dragonfly Topology and Routing
Perimeter-based Data Acquisition and Replication in Mobile Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Demetrios Zeinalipour-Yazti (Univ. of Cyprus)
SenseSwarm: A Perimeter-based Data Acquisition Framework for Mobile Sensor Networks Demetrios Zeinalipour-Yazti (Open Univ. of Cyprus) Panayiotis Andreou.
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks Hui Dai, Richar Han Department of Computer Science University of Colorado at Boulder.
Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/ th IEEE International Conference on Mobile Data Management (MDM’11), June.
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Paper By : Samuel Madden, Michael J. Franklin, Joseph Hellerstein, and Wei Hong Instructor :
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
Weaponizing Wireless Networks: An Attack Tool for Launching Attacks against Sensor Networks Thanassis Giannetsos Tassos Dimitriou Neeli R. Prasad.
Ubiquitous Networks WSN Routing Protocols Lynn Choi Korea University.
Data Collection Structures for Wireless Sensor Networks Demetris Zeinalipour, Lecturer Data Management Systems Laboratory (DMSL) Department of Computer.
Demetris Zeinalipour MHS: Minimum-Hot-Spot Query Trees for Wireless Sensor Networks Georgios Chatzimilioudis University of California - Riverside, USA.
Workload-aware Optimization of Query Routing Trees in Wireless Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Demetris Zeinalipour-Yazti (Open Univ.
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Authors: Samuel Madden, Michael Franklin, Joseph Hellerstein Presented by: Vikas Motwani CSE.
MINT Views: Materialized In-Network Top-k Views in Sensor Networks Demetrios Zeinalipour-Yazti (Uni. of Cyprus) Panayiotis Andreou (Uni. of Cyprus) Panos.
ETC: Energy-driven Tree Construction in Wireless Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Andreas Pamboris (Univ. of California – San Diego)
Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.
Query Processing for Sensor Networks Yong Yao and Johannes Gehrke (Presentation: Anne Denton March 8, 2003)
1 Extended Lifetime Sensor Networks Hong Huang, Eric Johnson Klipsch School of Electrical and Computer Engineering New Mexico State University December.
Multi-Criteria Routing in Pervasive Environment with Sensors Santhanakrishnan, G., Li, Q., Beaver, J., Chrysanthis, P.K., Amer, A. and Labrinidis, A Department.
UNIVERSITY COLLEGE DUBLIN Adaptive Radio Modes in Sensor Networks: How Deep to Sleep? SECON 2008 San Francisco, CA June 17, 2008 Raja Jurdak Antonio Ruzzelli.
Energy-Efficient Monitoring of Extreme Values in Sensor Networks Loo, Kin Kong 10 May, 2007.
KAIS T Distributed cross-layer scheduling for In-network sensor query processing PERCOM (THU) Lee Cheol-Ki Network & Security Lab.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
SEA-MAC: A Simple Energy Aware MAC Protocol for Wireless Sensor Networks for Environmental Monitoring Applications By: Miguel A. Erazo and Yi Qian International.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
By: Gang Zhou Computer Science Department University of Virginia 1 Medians and Beyond: New Aggregation Techniques for Sensor Networks CS851 Seminar Presentation.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.
Structure-Free Data Aggregation in Sensor Networks.
1 MobiQuery: A Spatiotemporal Query Service in Sensor Networks Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya Department.
The Design of an Acquisitional Query Processor For Sensor Networks Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong Presentation.
Structured parallel programming on multi-core wireless sensor networks Nicoletta Triolo, Francesco Baldini, Susanna Pelagatti, Stefano Chessa University.
1 An Overview of Distributed Top-K Ranking Algorithms 30-min presentation by Demetris Zeinalipour Lecturer School of Pure and Applied Sciences Open University.
TAG: a Tiny AGgregation service for ad-hoc sensor networks Authors: Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong Presenter: Mingwei.
INTRODUCTION TO WIRELESS SENSOR NETWORKS
MHS: Minimum-Hot-Spot Query Trees for Wireless Sensor Networks
Enabling QoS Multipath Routing Protocol for Wireless Sensor Networks
Jacob R. Lorch Microsoft Research
Distributed database approach,
Wireless Sensor Network Architectures
Presentation by Andrew Keating for CS577 Fall 2009
Dynamic Voltage Scaling
Investigating Mac Power Consumption in Wireless Sensor Network
Aggregation.
Presentation transcript:

The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks Demetrios Zeinalipour-Yazti (Univ. of Cyprus) Panayiotis Andreou (Univ. of Cyprus) Panos Chrysanthis (Univ. of Pittsburgh, USA) George Samaras (Univ. of Cyprus) Andreas Pitsillides (Univ. of Cyprus) http://www.cs.ucy.ac.cy/~dzeina/ DISN 2007 (MDM’07) © Zeinalipour-Yazti, Andreou, Chrysanthis, Samaras, Pitsillides

System Model Distributed Sensing + Centralized Storage A continuous Data Acquisition Framework Hierarchical (tree-based) routing Sink

Motivation Limitations Energy: Extremely limited (e.g. AA batteries) Communication: Transmitting 1 bit over the radio consumes as much energy as ~1000 CPU instructions. Solution Power down the radio transceiver during periods of inactivity. Studies have shown that a 2% duty cycle can yield lifetimes of 6 months using 2 AA batteries

Definitions Definition: Waking Window (τ) The continuous interval during which sensor A: Enables its Transceiver. Collects and Aggregates the results from its children for a given Query Q. Forwards the results of Q to A’s parent. Remarks τ is continuous. τ can currently not be determined in advance.

Definitions Tradeoff Small τ : Decrease energy consumption + Increase incorrect results Large τ: Increase energy consumption + Decrease incorrect results Problem Definition Automatically tune τ, locally at each sensor without any global knowledge or user intervention.

Presentation Outline Motivation - Definitions Background on Waking Windows The MicroPulse Framework Construction Phase Dissemination Phase Adaptation Phase Experimentation Conclusions & Future Work

Background on Waking Windows The Waking Window in TAG* Divide epoch e into d fixed-length intervals (d = depth of routing tree) When nodes at level i+1 transmit then nodes at level i listen. * Madden et. al., In OSDI 2002.

Background on Waking Windows Example: The Waking Window in TAG epoch=31, d (depth)=3 yields a window τi = ëe/dû = ë31/3û = 10 Transmit: [20..30) Listen: [10..20) A C level 1 B D E level 2 level 3 Transmit: [10..20) Listen: [0..10) Transmit: [0..10) Listen: [0..0)

Background on Waking Windows Disadvantages of TAG’s τ τ is an overestimate In our experiments we found that it is three orders of magnitude bigger than required. τ does not capture variable workloads e.g., X might need a larger τ in (time+1) X Y Z 100 tuples time + 1 X 3 tuples Y Z time

Background on Waking Windows The Waking Window in Cougar* Each node maintains a “waiting list”. Forwarding of results occurs when all children have answered (or timer h expires) A C level 1 B D E level 2 level 3 ø D,E B,C Listen… OK OK OK Listen… Listen..OK OK * Yao and Gehrke, In CIDR 2003.

Background on Waking Window Cougar’s Advantage (w.r.t. τ) More fine-grained than TAG. Cougar’s Disadvantage (w.r.t. τ) Parents keep their transceivers active until all children have answered….this is recursive.

Presentation Outline Motivation - Definitions Background on Waking Windows The MicroPulse Framework Construction Phase Dissemination Phase Adaptation Phase Experimentation Conclusions & Future Work

The MicroPulse Framework A new framework for automatically tuning τ. MicroPulse : Profile recent data acquisition activity Schedule τ using an in-network execution of the Critical Path Method (CPM) CPM is a graph-theoretic algorithm for scheduling project activities. CPM is widely used in construction, software development, research projects, etc.

The MicroPulse Framework MicroPulse Phases Construct the critical path cost Ψ. Disseminate Ψ in the network and define τ. Adapt the τ of each sensor based on Ψ. Intuition Ψ allows a sensor to schedule its waking window.

The Construction Phase Ψ1=max{11+13,15,22+20} s1 13 22 15 s4 Ψ2=max{11,7} s2 s3 Ψ4=max{20} 11 7 Ψ3=0 20 s5 s6 s7 Ψ5=0 Ψ6=0 Ψ7=0 , if si is a leaf node. , otherwise Recursive Definition:

The Dissemination Phase Construct Waking Windows (τ): “Disseminate Ψ = 42 to all nodes (top-down)” s1 42 22 13 15 s4 [29..42) s2 [20..42) 29 20 s3 20 11 7 s5 s6 [27..42) s7 [0..20) [18..29) [22..29)

The Dissemination Phase Construct Local Slack (λ): “maximum possible workload increase for the children of a node” s1 22 22 13 15 s4 λ=7 λ=0 λ=9 s2 11 20 s3 20 11 7 s5 s6 s7 λ=0 λ=4 λ=0

The Adaptation Phase Intuition Workload changes are expected, e.g., Epoch e Epoch e+1 Epoch e+2 s1 s1 s1 13 22 11 22 13 28 15 18 15 s4 s4 s4 s2 s3 s2 s3 s2 s3 Question: Should we reconstruct τ? Answer: Yes/No. No in Case e+1, because s2 & s3 know their local slack. Yes in Case e+2, because the critical path has been affected.

Presentation Outline Motivation - Definitions Background on Waking Windows The MicroPulse Framework Construction Phase Dissemination Phase Adaptation Phase Experimentation Conclusions & Future Work

Experimentation We have implemented a visual simulator that implements the waking window algorithm of TAG, Cougar and MicroPulse. Failure Rate = 20% Child Wait Expiration Timer h = 200 ms

Experimentation

Experimentation Dataset: Intel Lab Data 58 sensors deployed in the Intel Berkeley Research Lab (28/2/04 – 5/4/04). 2.3 Million Readings: topology info, humidity, temperature, light and voltage Epoch = 31 seconds               Available at: http://db.csail.mit.edu/labdata/labdata.html

Experimentation Sensing Device We utilize the energy model of Crossbow’s TELOSB Sensor (250Kbps, RF On: 23mA) Trace-driven experimentation using Energy = Volts x Amperes x Seconds. Query: SELECT moteid, temperature FROM sensors EPOCH DURATION 1 min

Energy Consumption TAG versus MicroPulse The waking window in TAG is three orders of magnitude more expensive than in MicroPulse. TAG: 7,984mJ MicroPulse: 13.75±0.58mJ Difference attributed to the waking window τ : τ in TAG is uniform: 2.21sec. (31 /14 depth) τ in MicroPulse is non-uniform: 146ms on average.

Energy Consumption Cougar versus MicroPulse Same observation holds for Cougar (one order of magnitude more expensive) Cougar: 288.97±24.42mJ MicroPulse: 13.75±0.58mJ Observation: A failure at level K of the hierarchy results in a K*h increase in τ, where h is the expiration timer. COUGAR h Listen h Timeout h TIME

Presentation Outline Motivation - Definitions Background on Waking Windows The MicroPulse Framework Construction Phase Dissemination Phase Adaptation Phase Experimentation Conclusions & Future Work

Conclusions We have presented the design of MicroPulse that adapts the waking window of a sensing device. Experimentation with real datasets reveals that MicroPulse can reduce the cost of the waking window by three orders of magnitude. We intend to study more carefully the adaptation algorithms.

The MicroPulse Framework for Adaptive Waking Windows in Sensor Networks Thank you! Questions? This presentation is available at: http://www.cs.ucy.ac.cy/~dzeina/talks.html Related Publications available at: http://www.cs.ucy.ac.cy/~dzeina/publications.html DISN 2007 (MDM’07) © Zeinalipour-Yazti, Andreou, Chrysanthis, Samaras, Pitsillides