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

Segmental Dynamic Duty Cycle Control for Sampling Scheduling in Wireless Sensor Networks

Author

Listed:
  • Lufeng Mo
  • Yujia Jiang
  • Guoying Wang
  • Jizhong Zhao

Abstract

Wireless sensor networks for environment monitoring are usually deployed in the fields where electric or manual intervention cannot be accessed easily. Therefore, we hope to minimize the times of sampling to reduce energy consuming. Energy-efficient sampling scheduling can be realized using compressive sensing theory on the basis of temporal correlation of the physical process. However, the degree of correlation of neighboring data varies over time, which may lead to different reconstructive quality for different parts of data if constant duty cycle is used. We proposed SDDC, a segmental dynamic duty cycle control method, for sampling scheduling in wireless sensor networks based on compressive sensing. Using a priori knowledge obtained by means of analysis on earlier sensing data, dynamic duty cycle is determined according to the linear degree of data in each segment. The experimental results using data from soil respiration monitoring sensor networks show that the proposed SDDC method can lead to better reconstructive quality compared to constant duty cycle of the same average sampling rate. That is to say, the SDDC method needs smaller sampling rate if the reconstructive error threshold is given and consequently saves more energy.

Suggested Citation

  • Lufeng Mo & Yujia Jiang & Guoying Wang & Jizhong Zhao, 2013. "Segmental Dynamic Duty Cycle Control for Sampling Scheduling in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 267935-2679, November.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:267935
    DOI: 10.1155/2013/267935
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/267935
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/267935?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:9:y:2013:i:11:p:267935. 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.