Competing Approaches and Performance Evaluation Ramanuja Vedantham, Raghupathy Sivakumar GNAN Research Group, Georgia Institute of Technology Wireless.

Slides:



Advertisements
Similar presentations
Directed Diffusion for Wireless Sensor Networking
Advertisements

Virtual Time “Virtual Time and Global States of Distributed Systems” Friedmann Mattern, 1989 The Model: An asynchronous distributed system = a set of processes.
Lower-Power Distributed Event Detection in WSNs Y. Zhu, Y. Liu, M. Ni, Z. Zhang Presented by Shan Gao.
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
Ethernet – CSMA/CD Review
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
Chapter 8. Pipelining. Instruction Hazards Overview Whenever the stream of instructions supplied by the instruction fetch unit is interrupted, the pipeline.
1 An Approach to Real-Time Support in Ad Hoc Wireless Networks Mark Gleeson Distributed Systems Group Dept.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
An Energy-Efficient Data Storage Scheme for Multi- resolution Query in Wireless Sensor Networks 老師 : 溫志煜 學生 : 官其瑩.
Ordering and Consistent Cuts Presented By Biswanath Panda.
CPSC 668Set 16: Distributed Shared Memory1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
1 IMPROVING RESPONSIVENESS BY LOCALITY IN DISTRIBUTED VIRTUAL ENVIRONMENTS Luca Genovali, Laura Ricci, Fabrizio Baiardi Lucca Institute for Advanced Studies.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
A Scalable Approach for Reliable Downstream Data Delivery in Wireless Sensor Networks Seung-Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar and Lan.
Supervisor: Mr. Hai Vortman. The ultimate goal Creating a wireless sensor network using Bluetooth technology.
Lecture 12 Synchronization. EECE 411: Design of Distributed Software Applications Summary so far … A distributed system is: a collection of independent.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
DETERMINATION OF THE TOPOLOGY OF HIGH SURVIVAL HF RADIO COMMUNICATION NETWORK Andrea Abrardo.
Network Kernel Architectures and Implementation ( ) Naming and Addressing Chaiporn Jaikaeo Department of Computer Engineering.
Layered Approach using Conditional Random Fields For Intrusion Detection.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Mutual Exclusion in Wireless Sensor and Actor Networks IEEE SECON 2006 Ramanuja Vedantham, Zhenyun Zhuang and Raghupathy Sivakumar Presented.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Using Pattern of Social Dynamics in the Design of Social Networks of Sensors - Marello Tomasini, Franco Zambonelli, Ronaldo Menezes 한국기술교육대학교 전기전자통신 공학부.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
An Adaptive, High Performance MAC for Long- Distance Multihop Wireless Networks Presented by Jason Lew.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Copyright © Lopamudra Roychoudhuri
Rajnish Kumar, Mina Sartipi, Junsuk Shin, Ramanuja Vedantham, Yujie Zhu, Faramarz Fekri, Umakishore Ramachandran, Raghupathy Sivakumar Application Energy-Efficient.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Copyright © 2007 OPNET Technologies, Inc. CONFIDENTIAL - RESTRICTED ACCESS: This information may not be disclosed, copied, or transmitted in any format.
Wireless sensor and actor networks: research challenges
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Jinfang Jiang, Guangjie Han, Lei Shu, Han-Chieh Chao, Shojiro Nishio
1 Ethernet CSE 3213 Fall February Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Principles of reliable data transfer 0.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
Relying on Safe Distance to Achieve Strong Partitionable Group Membership in Ad Hoc Networks Authors: Q. Huang, C. Julien, G. Roman Presented By: Jeff.
Structure-Free Data Aggregation in Sensor Networks.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Cascading : An Overview of the Strategy Yujie Zhu and Raghupathy Sivakumar GNAN Research Group, Georgia Tech Energy-Efficient Communication Strategy for.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Wireless Sensor Networks
Delay-Tolerant Networks (DTNs)
Introduction to Wireless Sensor Networks
Communication through Silence in Wireless Sensor Networks
Wireless Sensor Networks
Wireless Sensor Network Architectures
Parallel and Distributed Simulation Techniques
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Commit Protocols CS60002: Distributed Systems
Effective Replica Allocation
CSE 313 Data Communication
Presentation transcript:

Competing Approaches and Performance Evaluation Ramanuja Vedantham, Raghupathy Sivakumar GNAN Research Group, Georgia Institute of Technology Wireless Sensor and Actor Networks Addressing Hazards in Wireless Sensor and Actor Networks Wireless Sensor and Actor Networks (WSAN): New class of networks capable of performing both sensing and operating tasks on the environment Consists of sink, sensors and actors Allows automated sensing and execution for a given application Typical WSNs perform only one kind of operation: sensing the environment WSANs perform both sensing and operating on the environment Actors in WSANs typically have higher energy resources, larger transmission and acting range and are fewer in number than sensors Hazards Illustration: Hazards: Types: Conclusions and Future Work Hazards and the Different Types Out-of-order execution of directives from the order that the sink has issued, due to lack of coordination between sensors, actors and the sink  May lead to potentially undesirable changes in the environment  Example: Consider a fire extinguisher example with sprinklers as actors o Command to activate the sprinklers followed by query to check if the fire still exists is the order in which the sink has issued o If the order in which the directives arrive at the sensors and actors is reversed, the sink incorrectly issues a duplicate command to activate sprinklers CAC Hazard  If 2 sequential commands, Command1 and Command2 are issued to different actors in the event region, a CAC hazard occurs if Command2 is executed prior to Command1  Example: Fire extinguisher system with both sprinklers and fans as actors, where initially Command1 is sent to sprinklers and Command2 is sent to fans. If order of execution is reversed, the fan may cause the fire to spread to other areas before the sprinklers are activated QAC Hazard  Query-After-Command hazard occurs when a query issued after a command is executed prior to the command  Example: In the same fire extinguisher example, let Command1 be sent to fans followed by Query2 to humidity sensors. If Query2 is executed prior to Command1, the sink may incorrectly determine that the moisture level is still high and activate the fans again CAQ hazard  When a command issued after a query is executed prior to it, a Command- After-Query is said to have occurred  Example: Fire extinguisher system with sprinkler actors and heat sensors to detect fire, where Query1 is sent to detect the presence of fire and Command2 is sent to douse the fire. If the response for query1 reaches after Command2, the sink will not be able to determine the presence of fire Design of the Neighborhood Clock (NC) Approach Consider 2 sequential directives, X and Y, where X reaches a actor in event region via path Command1 and Y reaches a sensor via path Query2  If the response to Y is generated before X has been executed, a YAX hazard is said to have occurred Observation on hazard-free operation: Observations for hazard free operation  Any pair of dependent directives issued to entities that do not have any overlapping execution regions can be executed concurrently across the two entities, although the relative ordering must be preserved within each entity  Any pair of dependent directives issued to entities with overlapping execution regions needs to be ordered in the union of the two regions Dependency region: Based on the above two observations, for each entity there is a region surrounding it, where hazard free operation is required  Dependency region for sensor = circle of radius (sensing range + acting range)  Dependency region for actor = circle of radius ( 2 x acting range ) Design of NC Approach: NC introduces the notion of a neighborhood clock on every sensor and actor for ordering the directives within every dependency region Sink creates a unique reference clock initially and sensors and actors initialize their clocks to this value Each entity, Dx, maintains its own view of the progress in the network, based on its neighborhood clock identier, NC(x), where the view number is set to be NC(x) + 1 Each sensor and actor will move to the next view only after all other sensors and actors have moved into its current view Competing Approaches: Bounded Delay (BD) approach:  Sink waits for a specified amount of time after issuing a query or command  After issuing a query or command, sink waits for times TWs and Twa, corresponding to a fixed specified time to receive all responses from sensors and actors respectively Wait-For-All (WFA) approach:  Sink issues next directive only after it receives all responses or notifications of execution of that directive from all entities in the event region  If the sink sent a command, it will wait for all notifications about the completion of the command from all actors before it issues another query or command Results: Total traffic and directives execution throughput of Bounded Delay (BD), Wait-For-All (WFA) and the NC Approach  Proposed approach has lesser traffic overhead WFA but higher traffic than BD, which does not require any overhead as it is just based on waiting time. However, BD does not guarantee 100% correctness and hazard probability increases with event region size  Proposed approach has the maximum directives execution throughput because it just requires hazard avoidance within the dependency region Identified the different types of hazards in WSANs with example Identified the design principle that needs to be exploited in designing an efficient approach to address hazards Proposed a distributed approach that completely addresses the hazards Conclusions: To demonstrate the different hazards and address these hazards using prototype implementation Future Work: