Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks ChalermekRameshDeborah Intanagonwiwat Govindan Estrin Mobicom 2000.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

Directed Diffusion for Wireless Sensor Networking
Protocols for Wireless Sensor Networks
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/6/26.
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin.
Rumor Routing Algorithm For Sensor Networks
UNIVERSITY OF SOUTHERN CALIFORNIA RUGGeD: RoUting on finGerprint GraDients in Sensor Networks Jabed Faruque, Ahmed Helmy Wireless Networking Laboratory.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
DIRECTED DIFFUSION. Directed Diffusion Data centric A node request data by sending interest for named data Data matching interest is drawn toward that.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin (MobiCOM.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Routing.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.
Sensor Networks Issues Solutions Some slides are from Estrin’s early talks.
1-1 Routing. 1-2 Data-Centric Routing r Paradigm shift from accessing data from individual nodes to accessing “relevant” data. m Data within certain region,
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Intanagonwiwat, Govindan, Estrin USC, Information Sciences Institute,
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented by Cuong Le (CPSC538A)
U NIVERSITY OF M ASSACHUSETTS, A MHERST – Department of Computer Science Routing and Data Dissemination Presented by: Li, Huan Liu, Junning.
CS 265 PROJECT Secure Routing in Wireless Sensor Networks : Directed Diffusion a study Ajay Kalambur.
Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva Mobicom 2000.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Charlmek Intanagonwiwat Ramesh Govindan Deborah Estrin Presentation.
Presenter: Malik Tubaishat Department of Computer Science University of Missouri - Rolla Next Century Challenges: Scalable Coordination in Sensor Networks.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
1 The Data Dissemination Problem  A region requires event- monitoring (harmful gas, vehicle motion, seismic vibration, temperature, etc.)  Deploy sensors.
Department of Computer Science University of Massachusetts, Amherst PRESTO: Feedback-driven Data Management in Sensor Network Ming Li, Deepak Ganesan,
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
Data Dissemination and Fusion In Sensor Networks.
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.
Routing and Data Dissemination. Outline Motivation and Challenges Basic Idea of Three Routing and Data Dissemination schemes in Sensor Networks Some Thoughts.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks presented by: Stoyan Paunov Authors: Intanagonwiwat, C., Govindan,
INT598 Data-Centric Routing Protocols
 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
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
Routing in Sensor Networks. –Routing means carrying data packets from a source node to a destination node (usually called sinks in sensor networks terminology)
Data Dissemination in Sensor Networks Challenges and Solutions by Sovrin Tolia.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
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.
Sensor Network Data Dissemination based on the paper titled Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Routing and Dissemination in Wireless Sensor Networks Sandeep Gupta Based on Slides by Huan and Junning U. Mass.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
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)
Structure-Free Data Aggregation in Sensor Networks.
Building Wireless Efficient Sensor Networks with Low-Level Naming J. Heihmann, F.Silva, C. Intanagonwiwat, R.Govindan, D. Estrin, D. Ganesan Presentation.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Copyright © Wireless Sensor Networks: Classic Protocols Polly Huang Department of Electrical.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
A Survey on Routing Protocols for Wireless Sensor Networks Kemal Akkaya & Mohamed Younis By Yalda Edalat.
1 Sensor Network Routing – II Data-Centric Routing.
Routing protocols for sensor networks.
Wireless Sensor Networks
Wireless Sensor Networks
Protocols for Wireless Sensor Networks
Introduction to Wireless Sensor Networks
DIRECTED DIFFUSION.
Wireless Sensor Networks
Wireless Sensor Networks
Wireless Sensor Network Architectures
DIRECTED DIFFUSION.
Routing and Data Dissemination
Develop distributed algorithms for sensor networks which provide:
Presentation transcript:

Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks ChalermekRameshDeborah Intanagonwiwat Govindan Estrin Mobicom 2000

Capability of Sensor Nodes Small cheap nodes. Wireless communication. Significant computation. Caching

General Background Sensor node How many pedestrians do u observe in geographical region x ? Sensor node Result

Motivation Sending data over long distances requires more energy. Aim : Scalability Fault tolerance Minimize energy usage Suitable for dynamic network

Traditional Approach Sensor node Central Node Sensor node Long Range Communication Looses Battery Sensor node

Proposed Approach Intermediate node can :- Cache data Transform Data Direct interest towards previously cached data

Interest and Event Naming Query/interest/Task Description: 1.Type=four-legged animal 2.Interval=20ms //send back events every 20ms 3.Duration=10 seconds //for the rest 10s 4.Rect=[-100, 100, 200, 400] // location Reply: 1.Type=four-legged animal 2.Instance = elephant 3.Location = [125, 220] 4.Intensity = Confidence = Timestamp = 01:20:40

Interest Propagation Source Sink Initial Interest Type=four-legged animal Interval= 1s Rect=[-100, 100, 200, 400] Timestamp =01:20:40 ExpiresAt =01:30:40 Tries to determine which sensor data has the source Interest Data Gradient

Summary of the protocol A A B B C C Carried out by each node Reinforcement

Source Sink Interest Data Reinforcement

Source Sink Initial Interest Type=four-legged animal Interval= 10ms Rect=[-100, 100, 200, 400] Timestamp =01:20:40 ExpiresAt =01:30:40 Increase gradient

Gradient Types Binary Value Probabilistic forwarding –load balancing

Interest Cache/Data Propagation TypeRectTimestampGradient Four-legged animal Instance- elephant [-100, 100, 200, 400] 01:20:40 Last received matching interest Neighbor 1- Data rate, duration Neighbor 2- Data rate, duration Local Interaction

Negative Reinforcement Option 1 B B C C A A Wait for it to time out. Gradient = 1s Gradient = 10ms

Negative Reinforcement Option 2 B B C C A A Decrease the gradient. Gradient = 10ms Gradient = 2s

Average Dissipated Energy Average Dissipated Energy (Joules/Node/Received Event) Network Size Diffusion Omniscient Multicast Flooding

Impact of In-network Processing Average Dissipated Energy (Joules/Node/Received Event) Network Size Diffusion With Suppression Diffusion Without Suppression

Impact of Negative Reinforcement Average Dissipated Energy (Joules/Node/Received Event) Network Size Diffusion With Negative Reinforcement Diffusion Without Negative Reinforcement

Pros : Reinforcement maintains adequate number of high quality paths. It favors the best path. Energy efficiency improves. Resilient to Failures. Not a centralized approach. Caching helps improve response times.

Pros :Interest Cache/Data Propagation TypeRectTimestampGradient Last received matching interest Neighbor 1- Data rate, duration Neighbor 2- Data rate, duration Local Interaction All interactions are localized. Thus it is more robust and scalable.

Cons 1- Interest and Event Naming Query/interest/Task Description: Type=four-legged animal Interval=20ms //send back events every 20ms Duration=10 seconds //for the rest 10s Rect=[-100, 100, 200, 400] // location Reply: Type=four-legged animal Instance = elephant Location = [125, 220] Intensity = 0.6 Confidence = 0.85 Timestamp = 01:20:40 Cons : 1)The sensor nodes should be application aware before deployment. 2)The algorithm is limited by the size of the dataset Type

Query like “count the number of animals” cannot take leverage of the event data rate. Reinforcement rule can lead to waste of resources ex: if a node send data better then more load on that node. Capacity of other nodes are wasted Cons 2

B B Y Y Source 1 Cons 3 - Multiple Sources C C A A D D Source 2 B’s events A’s events

B B Y Y Cons 4 - Multiple Sinks C C A A X X Sink B’s events A’s events Source Sink

Discussions –Piazza 1:30pm 1)In case of emergencies, there might be a lot of broadcasting that will take place. Congestion ? Effect on energy-efficiency ? 2) What happens if there is a malicious node in the network? 3) Tests were performed in simulation. 4) Unreliable transmission ? Use of acknowledgements.

Discussions 5) What is the location is not rectangular ? 6) Global Optima ?