1 / 23

SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks

SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks. Authors: Sooyeon Kim, Sang H. Sony, John A. Stankovicy, Shuoqi Liy, Yanghee Choi Presented by: Chih-Ping Chou. SAFE. SAFE (Sinks accessing data from environment)

jaime-bryant
Download Presentation

SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks

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. SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks Authors: Sooyeon Kim, Sang H. Sony, John A. Stankovicy, Shuoqi Liy, Yanghee Choi Presented by: Chih-Ping Chou

  2. SAFE • SAFE (Sinks accessing data from environment) • Attempts to save energy through data dissemination path sharing among multiple data sinks.

  3. Intended data dissemination path

  4. Why SAFE? • TTDD • Directed Diffusion

  5. Why SAFE? (cont.) • It's a heavy load to construct grid networks per data source. • It's infeasible to let every potential data source keep flooding their measurement before any explicit user requests. • Complicated setup phase of grid construction • Long-term comparison between multiple data delivery paths -fast reaction to a data update request is required

  6. Protocol design criteria • Immediate deployment -short-term startup (e.g., network topology construction) • Adaptability -scalable to both the number of data sources and the data sink populations -diversity of user requests in terms of data update rates and service durations • Fast response to data requests -lower delay after users request sensor data updates • Energy efficiency -lower energy dissipation -extend the network lifetime

  7. Data dissemination in a two-tiered network • Stationary sensor nodes • Mobile data users

  8. Environmental model • ATMEL 90LS8535 processor • 8 KB flash program memory • 512 byte SRAM data memory • RF Monolithic 916.50 MHz transceiver • Photo/Temperature sensors

  9. Proposed Protocol Two major phases: • Query transfer • Dissemination path setup Query format: -area = [1850, 2150, 60, 900] -attribute = carbon monoxide -interval = 0.5 second -duration = 70 seconds

  10. Data management table

  11. Query transfer recvQuery(q) 1 if isRecentlyDealtWith (q) 2 then return 3 saveQueryAsRecentOne (q) 4 if isSource (q) 5 then sendPathSetup (sender(q)) 6 else if isJunction (q) 7 then sendJunctionInfo (sender(q)) 8 else if isApproachingToSource (q) 9 then forwardQueryToNextHop (q)

  12. Dissemination path setup recvPathSetup (p) 1 if destination (p) 6= myAddr 2 then if noEntryInDataManTable (p) 3 then e createEntry (p) 4 waitForAckFromSink (e) 5 else /* if the PathSetup p is destined for this node */ 6 then e findEntry (p) 7 if currState (e) = QUERY SENT 8 then sendAck (hopSender (p)) 9 changeMyState (e, SUBSCRIBE SENT) 10 else if currState (e) = FEEDBACK RCVD 11 then if bestFeedbackCost (e) > cost (p) 12 then saveAsBestFeedback (p)

  13. Data delivery paths

  14. Data delivery paths (cont.)

  15. Data delivery paths (cont.)

  16. Data delivery paths (cont.)

  17. Simulation results

  18. Conclusion • Energy efficiency • Scalability Both of which are crucial for large-scale battery-powered sensor networks

  19. Future work • Data aggregation that accumulates multiple data provision into a single hop-by-hop transfer • Timeliness

  20. Question?

More Related