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

Stair Scheduling for Data Collection in Wireless Sensor Networks

Author

Listed:
  • Jinbiao Chen
  • Yongcai Wang
  • Yuexuan Wang
  • Changjian Hu

Abstract

Spatially organized clusters are basic structure for large-scale wireless sensor networks. A cluster is generally composed by a large amount of energy-limited low-tier nodes (LNs), which are managed by a powerful cluster head (CH). The low-tier nodes that are close to the cluster head generally become bottlenecks in data collection applications. Energy efficient scheduling is important for the low-tier sensors to be longevous while guaranteeing reliable communication. In this paper, based on three aspects of performance considerations including network longevity, multihop communication reliability, and sensing system cost minimization, we propose a stair duty-cycle scheduling method for the low-tier sensors. It is designed to make the LNs in the same cluster sleep cooperatively for most of the time and wake up in assigned sequence for multihop communication. Stair scheduling cannot only improve the energy efficiency of the network but also guarantee high communication reliability and low transmission delay. Efficiency of the proposed stair scheduling is verified by analysis and intensive simulations. The results show that the performances of stair scheduling are much better than that of random scheduling algorithms.

Suggested Citation

  • Jinbiao Chen & Yongcai Wang & Yuexuan Wang & Changjian Hu, 2013. "Stair Scheduling for Data Collection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(4), pages 124786-1247, April.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:4:p:124786
    DOI: 10.1155/2013/124786
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1155/2013/124786?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:4:p:124786. 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.