Infocom’07 Authors:Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic Presented By Rohini Kurkal Under Guidance of Dr.Bin Tang.

Slides:



Advertisements
Similar presentations
Phil Buonadonna, Jason Hill CS-268, Spring 2000 MOTE Active Messages Communication Architectures for Networked Mini-Devices Networked sub-devicesActive.
Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Bio Michel Hanna M.S. in E.E., Cairo University, Egypt B.S. in E.E., Cairo University at Fayoum, Egypt Currently is a Ph.D. Student in Computer Engineering.
Group #1: Protocols for Wireless Mobile Environments.
1 Message Oriented Middleware and Hierarchical Routing Protocols Smita Singhaniya Sowmya Marianallur Dhanasekaran Madan Puthige.
Overview: Chapter 7  Sensor node platforms must contend with many issues  Energy consumption  Sensing environment  Networking  Real-time constraints.
S-MAC Sensor Medium Access Control Protocol An Energy Efficient MAC protocol for Wireless Sensor Networks.
1 Routing Techniques in Wireless Sensor networks: A Survey.
TOSSIM A simulator for TinyOS Presented at SenSys 2003 Presented by : Bhavana Presented by : Bhavana 16 th March, 2005.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks
IPSN/SPOTS 2007 Beacon Location Service A Location Service for Point-to-Point Routing in Wireless Sensor Networks EECS Department University of California,
Contiki A Lightweight and Flexible Operating System for Tiny Networked Sensors Presented by: Jeremy Schiff.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks Damla Turgut and Lotzi Bölöni University of Central Florida.
Incremental Network Programming for Wireless Sensors NEST Retreat June 3 rd, 2004 Jaein Jeong UC Berkeley, EECS Introduction Background – Mechanisms of.
KUASAR An efficient and light-weight protocol for routing and data dissemination in ad hoc wireless sensor networks David Andrews Aditya Mandapaka Joe.
Agent-Based Coordination of Sensor Networks Alex Rogers School of Electronics and Computer Science University of Southampton
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
Generic Sensor Platform for Networked Sensors Haywood Ho.
Generic Sensor Platform for Networked Sensors Haywood Ho.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
A. Frank - P. Weisberg Operating Systems Introduction to Cooperating Processes.
11 SERVER CLUSTERING Chapter 6. Chapter 6: SERVER CLUSTERING2 OVERVIEW  List the types of server clusters.  Determine which type of cluster to use for.
A measurement study of vehicular internet access using in situ Wi-Fi networks Vladimir Bychkovsky, Bret Hull, Allen Miu, Hari Balakrishnan, and Samuel.
Challenges of Process Allocation in Distributed System Presentation 1 Group A4: Syeda Taib, Sean Hudson, Manasi Kapadia.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Qing Cao, Tarek Abdelzaher(UIUC), John Stankovic, Kamin Whitehouse (UVA), Liqian Luo (MSR)
Parallel Programming Models Jihad El-Sana These slides are based on the book: Introduction to Parallel Computing, Blaise Barney, Lawrence Livermore National.
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
DATA PRESERVATION IN INTERMITTENTLY CONNECTTED SENSOR NETWORK WITH DATA PRIORITY Bin Tang Department of Computer Science California State University Dominguez.
EMP: A Network Management Protocol for IP-Based Wireless Sensor Networks 2010 International Conference on Communication in Wireless Environments and Ubiquitous.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Wireless Sensor Networks COE 499 Energy Aware Routing
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Why Visual Sensor Network & SMAC Implementation Group Presentation Raghul Gunasekaran.
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
IntroductionRelated work 2 Contents Publish/Subscribe middleware Conclusion and Future works.
SolarStore: Enhancing Data Reliability in Solar-powered Storage-centric Sensor Networks Yong Yang, Lili Wang, Dong Kun Noh, Hieu Khac Le and Tarek F. Abdelzah.
Simulation of Distributed Application and Protocols using TOSSIM Valliappan Annamalai.
Enabling Large-Scale Storage in Sensor Networks with the Coffee File System ISPN 2009 Lawrence.
Chapter 1 Introduction to Databases. 1-2 Chapter Outline   Common uses of database systems   Meaning of basic terms   Database Applications  
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Xiong Junjie Node-level debugging based on finite state machine in wireless sensor networks.
Evaluating Wireless Network Performance David P. Daugherty ITEC 650 Radford University March 23, 2006.
Energy-Conserving Data Placement and Asynchronous Multicast in Wireless Sensor Networks Sagnik Bhattacharya, Hyung Kim, Shashi Prabh, Tarek Abdelzaher.
SATIRE: A Software Architecture for Smart AtTIRE R. Ganti, P. Jayachandran, T. F. Abdelzaher, J. A. Stankovic (Presented by Linda Deng)
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Introduction Contain two or more CPU share common memory and peripherals. Provide greater system throughput. Multiple processor executing simultaneous.
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)
Chapter 7 Memory Management Eighth Edition William Stallings Operating Systems: Internals and Design Principles.
Building Wireless Efficient Sensor Networks with Low-Level Naming J. Heihmann, F.Silva, C. Intanagonwiwat, R.Govindan, D. Estrin, D. Ganesan Presentation.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Niosha Behnam CMPE 259 – Fall  Real-time data availability is not required for all sensor networks.  Robust disconnected operation is a needed.
Wireless Sensor Networks
Chapter 8: Memory management
Outline Module 1 and 2 dealt with processes, scheduling and synchronization Next two modules will deal with memory and storage Processes require data to.
COMP755 Advanced Operating Systems
Presentation transcript:

Infocom’07 Authors:Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic Presented By Rohini Kurkal Under Guidance of Dr.Bin Tang

Contents Introduction System Design Implementation Performance Evaluation Possible Extensions

Introduction Applications: -Environmental monitoring/data logging No real time communication b/w sensor and sink Disconnected system EnviroStore - cooperative storage system for sensor networks suitable for disconnected operation It is storage-centric rather than communication-centric Major concern -maximizing effective storage capacity Implemented in nesC for TinyOS and evaluated in TOSSIM

Storage centric paradigm  Should be simple and lightweight  Micaz has only an 8MHz 8-bit processor and a 4KB RAM,  Iris has 8KB RAM, 512KB Measurement Flash Memory  Sensor nodes do not maintain files but just writes data to collection station and never read the data they write  Data redistribution–must improve overall storage utilization

System Design Sink – process that runs on a user’s PC, identified by a regular IP address and a well known TCP port Data mule-collects data wirelessly from encountered nodes and dumps these data later to the base station Two types of data mules: - Intentionally relay data b/w the sink and the sensor nodes - Opportunistic data upload

System Model

System Design Data redistribution is used to maximize the effective storage space of the sensor network In-network Data Redistribution: Sensor nodes are in a single network Overloaded nodes offload data to neighboring empty nodes Cross-partition Data Redistribution: Disconnected network Overloaded nodes upload to data mules Data Mules offload to under-loaded nodes

In-network data redistribution Uses lazy-offload scheme to save energy – postpones data balancing until the storage overflows Overloaded nodes should satisfy below conditions: R i R imbalance Where, R i = Remaining Storage size R TH = Threshold to delay data transfer R imbalance = Parameter to allow local imbalances R i ’ = Average remaining storage

Contd.. Bad Idea:  Selecting neighbor with largest remaining free space  This can cause data ping-pong Prevent data ping pong - bound the amount of data transfer Remaining storage & remaining node energy must be checked Node should not invoke or accept data redistribution unless its estimated energy lifetime > estimated storage lifetime

Cross-partition data redistribution Uses data mules Discriminate nodes (overloaded and under-loaded):  Data mule calculates its free storage value R’m as the weighted sum αR ’ +(1-α)R m. α = 1 : mule favors redistribution to neighborhood α =0 : emphasizes upload Conserve power and reduce message collision, nodes use back-off timers

Transition state of sensor node

System Architecture of sensor nodes

Implementation Implemented using nesC in Tinyos Local storage space of nodes is organized into a circular buffers Uses:  It consumes minimum code and data memory  organizes space as continuous data chunk  eliminates the need for free space management mechanisms  prolongs flash lifetime by balancing write access to different locations

Log Files Log-array file :  Simultaneously written by different nodes  Generates a sequence of log items  Logs attributes of environmental events independently monitored by multiple nodes Log-sequence file:  one writer at a time  Multiple nodes must coordinate with each other  Maintains unique & continuous serial numbers  Used in EnviroSuite

Log-Array File

Log-Sequence File

PerformanceEvaluation Basic deployment configuration: field of 80 × 80 ft 2, 36 nodes were deployed Two Scenarios: Scenarios 1: Single Disconnected sensor network Scenario 2 :Partitioned sensor network with data mules

Comparison of data storing rate at different time

Why EnviroStore is different ? Used for disconnected sensor networks Extra constraint of limited energy – use lazy offload Resource limitation of individual nodes Load balancing must be dependent only on local information Has additional challenge of redistributing data between entities that are disconnected

Possible Extensions use of controllable data mules to optimize data redistribution and upload data replacement policies to maximize the total amount of information instead of just the amount of stored data performance evaluation of EnviroStore on real hardware platform

THANK YOU