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

Adaptive WSN Scheduling for Lifetime Extension in Environmental Monitoring Applications

Author

Listed:
  • Jong Chern Lim
  • Chris Bleakley

Abstract

Wireless sensor networks (WSNs) are often used for environmental monitoring applications in which nodes periodically measure environmental conditions and immediately send the measurements back to the sink for processing. Since WSN nodes are typically battery powered, network lifetime is a major concern. A key research problem is how to determine the data gathering schedule that will maximize network lifetime while meeting the user's application-specific accuracy requirements. In this work, a novel algorithm for determining efficient sampling schedules for data gathering WSNs is proposed. The algorithm differs from previous work in that it dynamically adapts the sampling schedule based on the observed internode data correlation as well as the temporal correlation. The performance of the algorithm has been assessed using real-world datasets. For two-tier networks, the proposed algorithm outperforms a highly cited previously published algorithm by up to 512% in terms of lifetime and by up to 30% in terms of prediction accuracy. For multihop networks, the proposed algorithm improves on the previously published algorithm by up to 553% and 38% in terms of lifetime and accuracy, respectively.

Suggested Citation

  • Jong Chern Lim & Chris Bleakley, 2011. "Adaptive WSN Scheduling for Lifetime Extension in Environmental Monitoring Applications," International Journal of Distributed Sensor Networks, , vol. 8(1), pages 286981-2869, December.
  • Handle: RePEc:sae:intdis:v:8:y:2011:i:1:p:286981
    DOI: 10.1155/2012/286981
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/286981
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/286981?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:8:y:2011:i:1:p:286981. 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.