1 / 20

Arijit Ghosh and Tony Givargis Center for Embedded Computer Systems Department of Computer Science

LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks. Arijit Ghosh and Tony Givargis Center for Embedded Computer Systems Department of Computer Science. Design, Automation, and Test in Europe Conference and Exhibition (DATE’05). Outline.

penney
Download Presentation

Arijit Ghosh and Tony Givargis Center for Embedded Computer Systems Department of Computer Science

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. LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks Arijit Ghosh and Tony Givargis Center for Embedded Computer Systems Department of Computer Science Design, Automation, and Test in Europe Conference and Exhibition (DATE’05)

  2. Outline • Introduction • The LORD protocol • Simulation • Conclusion

  3. Introduction • Energy is a major design bottleneck in wireless sensor network • System energy conservation by reduction of active nodes • This paper propose a distributed node-scheduling protocol • Maintains coverage • The number of scheduled nodes is minimized

  4. Introduction • The node-scheduling problem is to identify a minimal subset C of F that covers A. More specifically, compute C: • F = {s1,s2,…,sŋ}

  5. Introduction Sj Sm is a redundant sensor Si Sm Sl Sk

  6. The LORD protocol • Set-up phase • All the sensors individually run a heuristic algorithm to decide their initial state • The steady phase • All dying sensors run a localized heuristic algorithm and nominate the sleeping sensors that can cover for themselves

  7. The LORD protocol ~set-up • Each sensor first builds up its list of neighbors, si.NL

  8. The LORD protocol ~set-up • s1.NL={s3,s4.s5}

  9. The LORD protocol ~set-up • The sensor sidefers its decision on its intial state untilall sensors sj such that sj ∈ si.NL and j < i have made their decisions

  10. The LORD protocol ~set-up

  11. Simulation • 50m x 50m • The sensing area of each is equal to its communication area and both are set to be a circle of radius 10m • We deploy 80, 90, 100, 110, 120 and 130 sensors

  12. The LORD protocol ~set-up • To eliminate this redundancy, each ON sensor sireevaluates its initial decision.

  13. The LORD protocol ~set-up sleep

  14. The LORD protocol ~steady

  15. The LORD protocol ~set-up • s1.NL={s3,s4.s5}

  16. Simulation ~System Lifetime

  17. Simulation ~Communication

  18. Simulation ~Communication overhead

  19. Conclusion • we have presented a distributed, localized and reactive protocol for node-scheduling in a sensor network. • As future work, we intend to incorporate other system dependent parameters, like routing and communication, in our protocol.

  20. Thank You!!

More Related