IHP Im Technologiepark 25 15236 Frankfurt (Oder) Germany IHP Im Technologiepark 25 15236 Frankfurt (Oder) Germany www.ihp-microelectronics.com © 2009 -

Slides:



Advertisements
Similar presentations
International Graduate School Cottbus / IHP microelectronics Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt.
Advertisements

Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Group #1: Protocols for Wireless Mobile Environments.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Impala: A Middleware System for Managing Autonomic, Parallel Sensor Systems Ting Liu and Margaret Martonosi Princeton University.
Study of Hurricane and Tornado Operating Systems By Shubhanan Bakre.
Chapter 13 (Web): Distributed Databases
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Leveraging IP for Sensor Network Deployment Simon Duquennoy, Niklas Wirstrom, Nicolas Tsiftes, Adam Dunkels Swedish Institute of Computer Science Presenter.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Goal: To build a ubiquitous and robust storage infrastructure Requirement: Scalability, availability, performance, robustness Solution: Dynamic object.
1: Operating Systems Overview
WSN Simulation Template for OMNeT++
1 Awareness Services for Digital Libraries Arturo Crespo Hector Garcia-Molina Stanford University.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
©Silberschatz, Korth and Sudarshan18.1Database System Concepts Centralized Systems Run on a single computer system and do not interact with other computer.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Gursharan Singh Tatla Transport Layer 16-May
Fault Tolerance in ZigBee Wireless Sensor Networks
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Sensor Coordination using Role- based Programming Steven Cheung NSF NeTS NOSS Informational Meeting October 18, 2005.
Event-Condition-Action Rule Languages over Semistructured Data George Papamarkos.
LOGO OPERATING SYSTEM Dalia AL-Dabbagh
Operating System Review September 10, 2012Introduction to Computer Security ©2004 Matt Bishop Slide #1-1.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
Distributed Database Systems Overview
Embedded Runtime Reconfigurable Nodes for wireless sensor networks applications Chris Morales Kaz Onishi 1.
Distributed Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
Ch 10 Shared memory via message passing Problems –Explicit user action needed –Address spaces are distinct –Small Granularity of Transfer Distributed Shared.
Oracle's Distributed Database Bora Yasa. Definition A Distributed Database is a set of databases stored on multiple computers at different locations and.
The Replica Location Service The Globus Project™ And The DataGrid Project Copyright (c) 2002 University of Chicago and The University of Southern California.
NGMAST 2008 A Proactive and Distributed QoS Negotiation Approach for Heterogeneous environments Anis Zouari, Lucian Suciu, Jean Marie Bonnin, and Karine.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
A policy-based per-flow mobility management system design
Design, Implementation and Tracing of Dynamic Backpressure Routing for ns-3 José Núñez-Martínez Research Engineer Centre Tecnològic de Telecomunicacions.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Virtual Machines Created within the Virtualization layer, such as a hypervisor Shares the physical computer's CPU, hard disk, memory, and network interfaces.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
Topic Distributed DBMS Database Management Systems Fall 2012 Presented by: Osama Ben Omran.
Internet of Things. IoT Novel paradigm – Rapidly gaining ground in the wireless scenario Basic idea – Pervasive presence around us a variety of things.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Lecture 4 Mechanisms & Kernel for NOSs. Mechanisms for Network Operating Systems  Network operating systems provide three basic mechanisms that support.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
HP Openview NNM: Scalability and Distribution. Reference  “HP Openview NNM: A Guide to Scalability and Distribution”,
EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Software Architecture of Sensors. Hardware - Sensor Nodes Sensing: sensor --a transducer that converts a physical, chemical, or biological parameter into.
PART1 Data collection methodology and NM paradigms 1.
Medium Access Control. MAC layer covers three functional areas: reliable data delivery access control security.
INTRODUCTION TO WIRELESS SENSOR NETWORKS
Self Healing and Dynamic Construction Framework:
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
Advanced Operating Systems
Providing Secure Storage on the Internet
Mobile Computing.
Layering & protocol stacks Johan Lukkien
Overview of Networking
Hongchao Zhou, Xiaohong Guan, Chengjie Wu
Presentation transcript:

IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved tinyDSM: A Highly Reliable Cooperative Data Storage For Wireless Sensor Networks Krzysztof Piotrowski, Peter Langendörfer, Steffen Peter

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Outline Motivation Goals Our solution Future work Conclusions

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Motivation Wireless Sensor Network is a loosely coupled multiprocessor system limitations - energy – trade-off between activity and lifetime - network – transmission losses, delays, network dynamics - computational power – adds to both above mentioned great number of nodes Cooperation in WSN is the way to success! Cooperation is data exchange!

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Motivation, cont. The Environment The size of the network is not limited -The data is locality bound Nodes appear and disappear -Nodes represent a medium for the data Cooperation based on data exchange in a common storage -Replication increases the reliability -Historical data increases the usability Need for mechanisms to exchange and store the data in a reliable way!

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Loosely coupled multiprocessors - not easy to program - memory consistency problems Distributed Shared Memory Introduces an additional layer to loosely coupled multiprocessors + hides the complexity + cares about memory consistency Consistency / performance trade-off Motivation, cont. CPU MEMORY CPU MEMORY COMMON MEMORY

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Goals A reliable data storage middleware Distributing the data items - availability - cooperative access - consistency of the replicas - historical data - event detection Security Configurable

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – the idea At start-up each node announces own shared variables The neighbours decide on a random basis to replicate it Changes to a shared variable are sent to the neighbours On update the new value is checked if any event occurred Every node having a replica can provide the data

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – addressing There is one global set of variables per application defines the shared part of the memory Each node has an address represented either by Id or location Each variable has its type defines the granularity The timestamp allows the versioning of the values allows creating history Each instance of a variable is a tuple

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – messages There are three types of request messages GET – request for reading a specific variable SET – request for writing a specific variable UPDATE – request for updating the replicas of a specific variable With or without acknowledgement (verification) Each of them is completed with an acknowledgement message ANSWER – the results for the GET request SET_ACK – indicates that the SET request was fulfilled UPDATE_ACK – indicates that an UPDATE request was fulfilled The GET and UPDATE messages are usually broadcast, all other messages are usually unicast.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – architecture Application logic defines the sources of data and actions in case of events. Event & Replication Logic takes the decision on the replication of data, storage of new data and controls data locating. It is also responsible for detecting the events for the new data. Query Logic is responsible for interpreting incoming messages (queries) and building results into answer messages. Memory Manager controls the physical data storage on the node. Communication Interface allows communication with other nodes.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – customization Policies control the behaviour of the system Policies chosen while defining a variable define the handling of all instances of that variable in the system - the requested consistency - the replication strategy - the used storage space, size of the history, etc. Policies can control the behaviour in case of an event - diverse strategies to avoid false positives and false negatives Policies allow for tuning the application - exchanging the policy file allows to create several versions of the application with different requirements using the same source code

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – preliminary evaluation 20 x 20 nodes network (regular grid) Several combinations of network parameters One defined variable Variable set once every five seconds Ten updates + up to five verifications (quality parameter) 25% replication probability (quantity parameter) Network name Replication range (hops) Radio rangeNumber of replicas Network1112 Network2126 Network3216

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – preliminary evaluation, cont.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – preliminary evaluation, cont.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – preliminary evaluation, cont.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved The solution – preliminary evaluation, cont.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Future work Definition of deployment scenarios for simulations additional simulations have to be done for several scenarios Definition and simulation the system parameters and mechanisms have to be defined and evaluated regarding the introduced costs and performance features Application programming tools have to be developed in order to make the use of the approach easier Moving the model to real Wireless Sensor Network verification of the model on real nodes potential hardware-software functionality shifts

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Future improvements Database abstraction layer allows accessing the data stored in the WSN like a database Distributed Event processing in case an event is detected it can be validated within the network Single system image version in smaller networks complete replication may be possible Global variables and ownership migration global variables are defined per network not per node to avoid access problems in case the owning node is lost the ownership can be transferred to another node

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Conclusions The presented reliable distributed data storage that adapts the number of replicas to the defined number is the first step towards providing the Distributed Shared Memory to the WSN Concept of DSM was primarily used to enable parallel distributed computing on powerful devices connected via powerful network interfaces The idea fits perfectly to the WSN application area as well Providing the concept to the WSN together with its features and tools that ease its use enables many new applications in that area It allows the nodes to operate more active and autonomous from a base station by injecting more intelligence into the network.

IHP Im Technologiepark Frankfurt (Oder) Germany © All rights reserved Thank you Questions?