CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein - Columbia University.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.
SYNOPSIS DIFFUSION For Robust Aggregation in Sensor Networks Suman Nath, Phillip B. Gibbons, Srinivasan Seshan, Zachary R. Anderson Presented by Xander.
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.
DNA Research Group 1 CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein.
Growth Codes: Maximizing Sensor Network Data Persistence Abhinav Kamra, Vishal Misra, Dan Rubenstein Department of Computer Science, Columbia University.
DNA Research Group 1 Growth Codes: Maximizing Sensor Network Data Persistence Abhinav Kamra, Vishal Misra, Dan Rubenstein Department of Computer Science,
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
June, 2002INFOCOM 1 Host Multicast: A Framework for Delivering Multicast to End Users Beichuan Zhang (UCLA) Sugih Jamin (UMich) Lixia Zhang (UCLA)
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave Distributed Computing Group Keno Albrecht Ruedi Arnold Michael Gähwiler Roger.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Adaptive Topology Discovery in Hybrid Wireless Networks
DNA Research Group 1 Growth Codes: Maximizing Sensor Network Data Persistence Vishal Misra Joint work with Abhinav Kamra, Jon Feldman (Google) and Dan.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Charlmek Intanagonwiwat Ramesh Govindan Deborah Estrin Presentation.
Xingbo Yu ()ICS280sensors Winter 2005 Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Networks A.ManJhi, S. Nath P. Gibbons CMU.
Reliable, Robust Data Collection in Sensor Networks Murali Rangan Russell Sears Fall 2005 – Sensornet.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Research Paper By V. D. Park and M. S. Corson.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Paper By : Samuel Madden, Michael J. Franklin, Joseph Hellerstein, and Wei Hong Instructor :
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
SAvPS – úvod Genči 2009 (bsaed on Tanenbaum’s slides.
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
TinyOS By Morgan Leider CS 411 with Mike Rowe with Mike Rowe.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
Adaptive Tree-based Convergecast Protocol CS 234 Project - Anirudh Ramesh Iyer, Swaroop Kashyap Tiptur Srinivasa, Tameem Anwar Guide - Prof. Nalini Venkatasubramanian,
COMPUTING AGGREGATES FOR MONITORING WIRELESS SENSOR NETWORKS Jerry Zhao, Ramesh Govindan, Deborah Estrin Presented by Hiren Shah.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Prophet Address Allocation for Large Scale MANETs Matt W. Mutka Dept. of Computer Science & Engineering Michigan State University East Lansing, USA IEEE.
Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Growth Codes: Maximizing Sensor Network Data Persistence abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein Columbia University, Google Inc. (SIGSOMM’06)
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
SIA: Secure Information Aggregation in Sensor Networks B. Przydatek, D. Song, and A. Perrig. In Proc. of ACM SenSys 2003 Natalia Stakhanova cs610.
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
1 REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
DATA AGGREGATION Siddhartha Sarkar Roll no: CSE-4 th Year-7 th semester Sensor Networks (CS 704D) Assignment.
Routing in Sensor Networks. –Routing means carrying data packets from a source node to a destination node (usually called sinks in sensor networks terminology)
Vishal Jain, AntNet Agent Based Strategy for CMDR “Agent Based Multiple Destination Routing ”
Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
William Stallings Data and Computer Communications 7th Edition
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Attribute Allocation in Large Scale Sensor Networks Ratnabali Biswas, Kaushik Chowdhury, and Dharma P. Agrawal International Workshop on Data Management.
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.
Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
Adlib : A Self-Tuning Index for Dynamic Peer-to-Peer Systems Proceedings of the 21st International Conference on Data Engineering(ICDE'05) Prasanna Ganesan.
TAG: a Tiny AGgregation service for ad-hoc sensor networks Authors: Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong Presenter: Mingwei.
William Stallings Data and Computer Communications
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Introduction to Wireless Sensor Networks
Wireless Sensor Network Architectures
Fisheye Routing protocol
Kuliah 5 ROUTING.
Ajay Vyasapeetam Brijesh Shetty Karol Gryczynski
Data-Centric Networking
Greedy Distributed Spanning tree routing (gdstr)
Aggregation.
Other Routing Protocols
Collection Tree Protocol
Design and Implementation of OverLay Multicast Tree Protocol
Presentation transcript:

CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein - Columbia University (ACM SenSys 2007) Presenter : Justin

A few definitions  Distributive queries (e.g. MIN, MAX, COUNT, SUM)  Form: f(p U q) = f( f(p), f(q) ), (p, q = set of disjoint nodes)  e.g. Sum: f(p U q) = |p| + |q|

A few definitions (cont.)  Two types of queries:  Duplicate-sensitive: e.g. SUM, COUNT  Duplicate-insensitive: e.g. MIN, MAX 3

Traditional data aggregation  Goal: Combine data values while routing to the sink  Two schemes  Tree-based  Multi-path example Tree-based (spanning tree) Multi-path (DAG) 4

Traditional data aggregation (cont.)  Tree-based  Error-prone in dynamic networks  Not accurate in failure-prone settings  Multi-path  Bandwidth overkill in stable networks  Have to avoid duplicate and redundant data  Still loses accuracy in high mobility/loss scenarios 5

CountTorrent: An adaptive approach  Adapt to network conditions:  Stable networks: accurate tree-based aggregation  Dynamic networks: multi-path aggregation, accuracy degrades gracefully  Completely distributed: local decisions  Can compute duplicate-sensitive and duplicate- insensitive query aggregates 6

CountTorrent: A conceptual overview  Divide and conquer strategy  Arrange information in a hierarchy using a (prefix- free) binary labeling  Combine disjoint information  Adapt the labeling as network changes

CountTorrent: Label assignment  Each node is assigned a unique (binary) label by its parent.  When a new node joins:  Chooses one of its neighbors as parent  Parent splits its label S into 2 separate labels S0 and S1: Child given label S1 h2 h3 h h4 h2 h3 h Node h4 joins Chooses h1 as parent

CountTorrent: Data combining  After a label is assigned to each node  All labels can be merged to form ε ε 21 9

CountTorrent: Data combining  Aggregating with tuples  Definition: Tuple = (binary label, aggregate value) pair  Labels differ only in last bit  merge tuples (11, 5)(01, 3)(001, 2)(011, 1)(10, 3)(001, 2) (011, 1)(11, 5)(10, 3)(001, 2)(011, 1)(1, 8)(001, 2) Node ANode B Neighbors exchange tuples randomly Merge any tuples if possible 10

CountTorrent: Variants  Static CountTorrent  Exchange tuples with neighbors  Dynamic CountTorrent  Addiction tuple cache contains tuples associated with the node’s children and its own label. b c a (10,4) (1100,2) (111,3) (1101,1) (111,3) …… d (10,4) (1100,2) (1101,1)(111,3) (10,4) (1100, 0 ) c a (111,3) …… d (10,4) (1101,1)(111,3) Send up node b leaves node a reset value of “1100” into 0 node d require new label from a c a (10,4) (11,3) …… d (10,4) (1101,1)(11,3) Update down 11

CountTorrent: Fine-tuning  Random exchange is not efficient: Convergence is slow  Optimizations:  Intelligent Selection  Carefully choose data to send to neighbors  Minimize redundant and duplicate tuple exchanges  Preferred Diffusion  Carefully choose neighbor to send data to  Fast convergence in stable networks 12

CountTorrent: Intelligent Selection  Node A sending to neighbor B  Remembers what was sent to B  Remembers what was received from B  Only send tuples that are useful for B (11, 5)(01, 3)(0010, 2)(10, 3)(001, 2) Node ANode B (11, 5)(10, 3)(001, 2) (1, 8)(001, 2) Node a won’t send (11,5) again (11, 5)(01, 3)(0010, 2) Node a won’t send (0010,2) to node b, since “001” is the prefix of “0010” (11, 5)(001, 2)(01, 3)(0010, 2) 13

CountTorrent: Preferred Diffusion  Preferential forwarding:  If any tuple useful for parent  Send  Else, if any tuple useful for a child  Send  Else, send to another neighbor  Stable networks: Mimics tree-based aggregation  Dynamic network: mix of tree-based and multi- path 14

Simulations & Experiments  Simulations:  Compare with other aggregation methods  Effect of Node joins & failures  Aggregation in a mobile network  Experiments on Tossim & motes:  CountTorrent implementation on Crossbow micaz motes 15

CountTorrent accuracy 16

Bandwidth usage 17

Adapting to node joins & failures 18

COUNT aggregate in a mobile network 19

CountTorrent on TOSSIM 20

CountTorrent on micaz motes 21

Conclusions  Robust: Accurate even in lossy networks  Adaptive: Data communication adapts to changing topology  Handles mobility: Close to accurate aggregates  Bandwidth-efficient: adapts to the stability of the network to maintain accuracy  Ubiquitous: All nodes get the aggregate by design 22