IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i3p242-261.html
   My bibliography  Save this article

Adaptive Sensor Activity Scheduling in Distributed Sensor Networks: A Statistical Mechanics Approach

Author

Listed:
  • Abhishek Srivastav
  • Asok Ray
  • Shashi Phoha

Abstract

This article presents an algorithm for adaptive sensor activity scheduling ( A-SAS ) in distributed sensor networks to enable detection and dynamic footprint tracking of spatial-temporal events. The sensor network is modeled as a Markov random field on a graph, where concepts of Statistical Mechanics are employed to stochastically activate the sensor nodes. Using an Ising-like formulation, the sleep and wake modes of a sensor node are modeled as spins with ferromagnetic neighborhood interactions; and clique potentials are defined to characterize the node behavior. Individual sensor nodes are designed to make local probabilistic decisions based on the most recently sensed parameters and the expected behavior of their neighbors. These local decisions evolve to globally meaningful ensemble behaviors of the sensor network to adaptively organize for event detection and tracking. The proposed algorithm naturally leads to a distributed implementation without the need for a centralized control. The A-SAS algorithm has been validated for resource-aware target tracking on a simulated sensor field of 600 nodes.

Suggested Citation

  • Abhishek Srivastav & Asok Ray & Shashi Phoha, 2009. "Adaptive Sensor Activity Scheduling in Distributed Sensor Networks: A Statistical Mechanics Approach," International Journal of Distributed Sensor Networks, , vol. 5(3), pages 242-261, May.
    • Handle: RePEc:sae:intdis:v:5:y:2009:i:3:p:242-261
    DOI: 10.1080/15501320802473250
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802473250
    Download Restriction: no
    File URL: https://libkey.io/10.1080/15501320802473250?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:5:y:2009:i:3:p:242-261. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.