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

A Strategy Based on Cooperative Transmission for Minimizing Delivery Delay in WSN

Author

Listed:
  • Qingyu Yang
  • Xinyu Yang
  • Yu Wang
  • Dou An

Abstract

To achieve the purpose of energy conservation, various sleep scheduling approaches, such as duty cycle, are applied in wireless sensor networks (WSN). However, the duty-cycle mechanism results in data delivery latency, which is critical to monitor applications. To minimize the delay caused by sleeping nodes in the transmission path, we propose to “hop over†the sleeping nodes based on the range extension of cooperative transmission (CT). The transmission delay models for the random duty-cycled WSN and optimized fixed duty-cycled WSN under cooperative operation are formulated, and an algorithm named (delay-tolerant cooperative transmission DTCT) is presented for the selection of transmission modes to avoid waiting for the sleeping nodes to wake up. The energy consumption model under direct transmission (DT) and CT mode is also presented. Theoretical analysis shows that sleep latency can be greatly reduced in the cooperative scheme, and it is validated by simulations that it outperforms the traditional store-and-forward (DT) mode in delivery latency. Especially, CT reduces 67% and 14.3% of the transmission delay in random and optimized fixed low duty-cycled WSN, respectively, and DTCT algorithm saves energy by 11.29% in random low duty-cycled WSN.

Suggested Citation

  • Qingyu Yang & Xinyu Yang & Yu Wang & Dou An, 2013. "A Strategy Based on Cooperative Transmission for Minimizing Delivery Delay in WSN," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 286237-2862, November.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:286237
    DOI: 10.1155/2013/286237
    as

    Download full text from publisher

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

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