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

LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks

Author

Listed:
  • Muhammad K Shahzad
  • Dang Tu Nguyen
  • Vyacheslav Zalyubovskiy
  • Hyunseung Choo

Abstract

Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.

Suggested Citation

  • Muhammad K Shahzad & Dang Tu Nguyen & Vyacheslav Zalyubovskiy & Hyunseung Choo, 2018. "LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks," International Journal of Distributed Sensor Networks, , vol. 14(4), pages 15501477187, April.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:4:p:1550147718767605
    DOI: 10.1177/1550147718767605
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147718767605
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147718767605?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Muhammad K. Shahzad & S. M. Riazul Islam & Mahmud Hossain & Mohammad Abdullah-Al-Wadud & Atif Alamri & Mehdi Hussain, 2020. "GAFOR: Genetic Algorithm Based Fuzzy Optimized Re-Clustering in Wireless Sensor Networks," Mathematics, MDPI, vol. 9(1), pages 1-18, December.

    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:14:y:2018:i:4:p:1550147718767605. 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.