Data-Centric Networking

Slides:



Advertisements
Similar presentations
Directed Diffusion for Wireless Sensor Networking
Advertisements

HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
1 Routing Techniques in Wireless Sensor networks: A Survey.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 25th Lecture Christian Schindelhauer.
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.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 24th Lecture Christian Schindelhauer.
588 Section 6 Neil Spring May 11, Schedule Notes – (1 slide) Multicast review –(3slides) RLM (the paper you didn’t read) –(3 slides) ALF & SRM –(8.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Aggregation in Sensor Networks NEST Weekly Meeting Sam Madden Rob Szewczyk 10/4/01.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Intanagonwiwat, Govindan, Estrin USC, Information Sciences Institute,
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented by Cuong Le (CPSC538A)
Internet Networking Spring 2002
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Charlmek Intanagonwiwat Ramesh Govindan Deborah Estrin Presentation.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 12: Data-centric and content-based networking Holger Karl.
Network Kernel Architectures and Implementation ( ) Naming and Addressing Chaiporn Jaikaeo Department of Computer Engineering.
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
Architectures and Applications for Wireless Sensor Networks ( ) Network Architecture Chaiporn Jaikaeo Department of Computer.
Network Kernel Architectures and Implementation ( ) Network Architecture Chaiporn Jaikaeo Department of Computer Engineering.
Ubiquitous Networks WSN Routing Protocols Lynn Choi Korea University.
March 6th, 2008Andrew Ofstad ECE 256, Spring 2008 TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden, Michael J. Franklin, Joseph.
Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.
Mohmmad Khalily Dermany Islamic Azad University. Goal Apart from routing protocols that use a direct identifier of nodes (either unique id or position.
IntroductionRelated work 2 Contents Publish/Subscribe middleware Conclusion and Future works.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.
BARD / April BARD: Bayesian-Assisted Resource Discovery Fred Stann (USC/ISI) Joint Work With John Heidemann (USC/ISI) April 9, 2004.
Network Kernel Architectures and Implementation ( ) Data-Centric and Content-Based Networking Chaiporn Jaikaeo Department of.
Data Dissemination in Sensor Networks Challenges and Solutions by Sovrin Tolia.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Multicasting EECS June Multicast One-to-many, many-to-many communications Applications: – Teleconferencing – Database – Distributed computing.
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY.
1 Sensor Network Routing – II Data-Centric Routing.
Data Query in Sensor Networks Carmelissa Valera Jason Torre Carmelissa Valera Jason Torre.
SPIN: Sensor Protocols for Information via Negotiation
TAG: a Tiny AGgregation service for ad-hoc sensor networks Authors: Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong Presenter: Mingwei.
Route Metric Proposal Date: Authors: July 2007 Month Year
Resource subscription using DDS in oneM2M
Ad hoc and Sensor Networks Chapter 12: Data-centric and content-based networking Holger Karl.
Protocols for Wireless Sensor Networks
SmartGossip: A Reliable Broadcast Service for Wireless Sensor Networks
Cellular IP: A New Approach to Internet Host Mobility
Multicast Outline Multicast Introduction and Motivation DVRMP.
Introduction to Wireless Sensor Networks
DIRECTED DIFFUSION.
Wireless Sensor Networks
Wireless Sensor Network Architectures
Sensor Network Routing
Internet Networking recitation #12
Net 323 D: Networks Protocols
Towards PubSub and Storage integration in ANIMA
Mobile and Wireless Networking
DIRECTED DIFFUSION.
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
PRESENTATION COMPUTER NETWORKS
Distributed Publish/Subscribe Network
Wireless Sensor Networks and Internet of Things
Wireless Sensor Networks and Internet of Things
Route Metric Proposal Date: Authors: July 2007 Month Year
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Data-Centric Networking 01204525 Wireless Sensor Networks and Internet of Things Chaiporn Jaikaeo (chaiporn.j@ku.ac.th) Department of Computer Engineering Kasetsart University Materials taken from lecture slides by Karl and Willig Cliparts taken from openclipart.org Last updated: 2018-10-27

Overview Interaction patterns and programming model Data-centric routing Data aggregation

Interaction Patterns Standard networking interaction Client/server, peer-to-peer Explicit or implicit partners, explicit cause for communication Desirable properties for WSN (and other applications) Decoupling in space – neither sender nor receiver need to know their partner Decoupling in time – “answer” not necessarily directly triggered by “question”, asynchronous communication

Publish/Subscribe Interaction Achieved by publish/subscribe paradigm Idea: Entities can publish data under certain names Entities can subscribe to updates of such named data Variations Topic-based: Inflexible Content-based use general predicates over named data Software bus Publisher 1 Publisher 2 Subscriber 1 Subscriber 2 Subscriber 3

P/S Implementation Options Central server: mostly not applicable Topic-based: group communication (multicast) Content-based: does not directly map to multicast Needs content-based routing/forwarding for efficient networking t = 35! t < 10 t > 20 t = 35! t > 20 t = 35! t < 10 or t > 20 t > 40 t = 35! t = 35! t < 10 or t > 20 t > 20 t < 10

Overview Interaction patterns and programming model Data-centric routing Data aggregation

One-Shot Interactions Too much overhead to explore topology For small data sets Flooding/gossiping For large data sets Idea: exchange data summary with neighbor, ask whether it is interested in data Only transmit data when explicitly requested Nodes should know about interests of further away nodes E.g., Sensor Protocol for Information via Negotiation (SPIN)

SPIN example ADV (1) REQ (2) DATA (3) (4) ADV (5) REQ (6) DATA

Repeated Interactions More interesting: Subscribe once, events happen multiple times Exploring the network topology might actually pay off But: unknown which node can provide data, multiple nodes might ask for data How to map this onto a “routing” problem?

Repeated Interactions Idea: Put enough information into the network so that publications and subscriptions can be mapped onto each other But try to avoid using unique identifiers One option: Directed diffusion Try to rely only on local interactions for implementation

Directed Diffusion Two-phase Pull Phase 1: nodes distribute interests Interests are flooded in the network Apparently obvious solution: remember from where interests came, set up a convergecast tree Problem? Sink 1 Sink 2 Sink 3 Source X Sink Source X

Direction Diffusion Option 1: Node X forwarding received data to all “parents” in a “convergecast tree” Not attractive, many needless packet repetitions over multiple routes Option 2: node X only forwards to one parent Not acceptable, data sinks might miss events

Direction Diffusion Option 3: Only provisionally send data to all parents, but ask data sinks to help in selecting which paths are redundant, which are needed Information from where an interest came is called gradient Forward all published data along all existing gradients

Gradient Reinforcement Gradients express not only a link in a tree, but a quantified “strength” of relationship Initialized to low values Strength represents also rate with which data is to be sent Intermediate nodes forward on all gradients Can use a data cache to suppress needless duplicates

Directed Diffusion Second phase: Nodes that contribute new data (not found in cache) should be encouraged to send more data Sending rate is increased, the gradient is reinforced Gradient reinforcement can start from the sink If requested rate is higher than available rate, gradient reinforcement propagates towards original data sources Adapts to changes in data sources, topology, sinks

Directed Diffusion - Example

Overview Interaction patterns and programming model Data-centric routing Data aggregation

Data Aggregation Packets may combine their data into fewer packets

Metrics for Data Aggregation Accuracy E.g., differences, ratios, statistics Completeness A form of accuracy Latency Message overhead

Expressing Aggregation Request One option: Use database abstraction Request by SQL clauses E.g., SELECT AVG(temperature), floor WHERE floor > 5 GROUP BY floor HAVING AVG(temperature) > 30

Intermediate Results Aggregation requires partial information to represent intermediate results Called Partial State Records E.g., to compute average, sum and number of previously aggregated values is required Expressed as <sum,count> Update rule: Final result is simply s/c

Behavior of Partial State Records Distributive – end results directly as partial state record, e.g., MIN, MAX, SUM Algebraic – p.s.r. has constant size; end result easily derived, e.g., AVG Content-sensitive – size and structure depend on measured values (e.g., histogram) Holistic – all data need to be included, e.g., median Unique – similar to holistic ones, but only distinct data values are needed

Conclusion Data-centric networking considerably changes communication protocol design paradigms Nicely supports an intuitive programming model – publish/subscribe Aggregation is a key enabler for efficient networking