1 / 15

Directed Diffusion for Wireless Sensor Networking

Directed Diffusion for Wireless Sensor Networking. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva Mobicom 2000. Routing Schemes - Anycast. Anycast – data is routed to the “nearest” or “best” destination Destinations identify a set of host Only one is chosen.

benjaminvance
Download Presentation

Directed Diffusion for Wireless Sensor Networking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, F. Silva Mobicom 2000

  2. Routing Schemes - Anycast • Anycast – data is routed to the “nearest” or “best” destination • Destinations identify a set of host • Only one is chosen

  3. Routing Schemes - Broadcast • Broadcast – data is routed to everyone • Used with Discovery Protocols • Can only be sent to nodes on that network segment

  4. Routing Schemes - Multicast • Multicast – data is delivered to everyone in the group • Destinations identify a set of host • Data is delivered to the whole set • Used with IRC, Video Streaming

  5. Routing Schemes - Unicast • Unicast – Data is sent to one destination • Used with Http, SMTP, POP, SSH, most services

  6. Directed Diffusion - Interests • Interests: a query which specifies what a user wants by naming the data. • Sink periodically broadcasts interest messages to each neighbor. • Includes the rectangle and duration attributes from the request. • Includes a larger interval attribute • All nodes maintain an interest cache

  7. Interest Cache

  8. Sensor Node • Receives interest packet • Node is within the rectangle coordinates • Task the sensor system to generate samples at the highest rate of all the gradients. • Data is sent using unicast

  9. Data Return

  10. Exploratory versus Data • Exploratory use lower data rates • Once the sensor is able to report the data a reinforcement path is created • Data gradients used to report high quality/high bandwidth data.

  11. Positive Reinforcement • Sink re-sends original interest message with smaller interval • Neighbor nodes see the high bandwidth request and reinforce at least one neighbor using its data cache • This process selects an empirically low-delay path.

  12. Multiple Sources & Sinks • The current rules work for multiple sources and sinks

  13. Repair • C detects degradation • Notices rate of data significantly lower • Gets data from another neighbor that it hasn’t seen • To avoid downstream nodes from repairing their paths C must keep sending interpolated location estimates.

  14. Negative Reinforcement • Repair can result in more than one path being reinforced • Time out gradients • Send negative reinforcement message

  15. Compared to traditional methods • Routes are established on command • No attempts to find a pre-determined loop-free path • Message caches are used for loop avoidance

More Related