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

Latency Improvement Strategies for Reliability-Aware Scheduling in Industrial Wireless Sensor Networks

Author

Listed:
  • Felix Dobslaw
  • Tingting Zhang
  • Mikael Gidlund

Abstract

We propose novel strategies for end-to-end reliability-aware scheduling in Industrial Wireless Sensor Networks (IWSNs). Because of stringent reliability requirements in industrial applications where missed packets may have disastrous or lethal consequences, all IWSN communication standards are based on Time Division Multiple Access (TDMA), allowing for deterministic channel access on the MAC layer. We therefore extend an existing generic and scalable reliability-aware scheduling approach by the name of SchedEx. SchedEx has proven to quickly produce TDMA schedules that guarantee a user-defined end-to-end reliability level Ï _ for all multihop communication in a WSN. Moreover, SchedEx executes orders of magnitude faster than recent algorithms in the literature while producing schedules with competitive latencies. We generalize the original problem formulation from single-channel to multichannel scheduling and propose a scalable integration into the existing SchedEx approach. We further introduce a novel optimal bound that produces TDMA schedules with latencies around 20% shorter than the original SchedEx algorithm. Combining the novel strategies with multiple sinks, multiple channels, and the introduced optimal bound, we could through simulations verify latency improvements by almost an order of magnitude, reducing the TDMA superframe execution times from tens of seconds to seconds only, which allows for a utilization of SchedEx for many time-critical control applications.

Suggested Citation

  • Felix Dobslaw & Tingting Zhang & Mikael Gidlund, 2015. "Latency Improvement Strategies for Reliability-Aware Scheduling in Industrial Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 178368-1783, October.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:178368
    DOI: 10.1155/2015/178368
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/178368
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/178368?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:11:y:2015:i:10:p:178368. 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.