Lord a localized reactive and distributed protocol for node scheduling in wireless sensor networks
This presentation is the property of its rightful owner.
Sponsored Links
1 / 20

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


  • 96 Views
  • Uploaded on
  • Presentation posted in: General

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.

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Lord a localized reactive and distributed protocol for node scheduling in wireless sensor networks

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

Outline

  • Introduction

  • The LORD protocol

  • Simulation

  • Conclusion


Introduction

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


Introduction1

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ŋ}


Introduction2

Introduction

Sj

Sm is a redundant sensor

Si

Sm

Sl

Sk


The lord protocol

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


The lord protocol set up

The LORD protocol ~set-up

  • Each sensor first builds up its list of neighbors, si.NL


The lord protocol set up1

The LORD protocol ~set-up

  • s1.NL={s3,s4.s5}


The lord protocol set up2

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


The lord protocol set up3

The LORD protocol ~set-up


Simulation

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


The lord protocol set up4

The LORD protocol ~set-up

  • To eliminate this redundancy, each ON sensor sireevaluates its initial decision.


The lord protocol set up5

The LORD protocol ~set-up

sleep


The lord protocol steady

The LORD protocol ~steady


The lord protocol set up6

The LORD protocol ~set-up

  • s1.NL={s3,s4.s5}


Simulation system lifetime

Simulation ~System Lifetime


Simulation communication

Simulation ~Communication


Simulation communication overhead

Simulation ~Communication overhead


Conclusion

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.


Thank you

Thank You!!


  • Login