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

A Time-Efficient Convergecast Scheduling on Star-Linear IWSN for Narrow Process Industries

Author

Listed:
  • Hong-hua Xu
  • Xinping Guan

Abstract

The wireless technology is regarded as a paradigm shifter in the process industry. A star-linear industry wireless sensor network (IWSN) for narrow process industries is proposed in this paper. Based on the proposed IWSN, we focus on time-efficient convergecast solutions. We present algorithms to achieve optimal convergecast performance in terms of time slots use. In the proposed IWSN, the field devices (FDs) constitute a set of TDMA (time division multiple access) based star topology clusters, and the cluster heads present a multihop linear backbone. Time slots are scarce communication resource for convergecast in a narrow IWSN. Aiming to use slots efficiently, we design optimal algorithms to improve the polling scheduling in the cluster and the packets forwarding over the backbone. In a cluster, we design a multicycle scheduling algorithm and a fair polling algorithm to improve slots utility of the communication reliability and integrity. Over the backbone, an optimal slots allocating algorithm is designed to maximize the slots performance in terms of the end-to-end communication reliability, based on which a slot-efficient multisuperframe scheduling algorithm is presented. Performance analysis and simulations show that our solution outperforms traditional ones in terms of communication reliability and real-time.

Suggested Citation

  • Hong-hua Xu & Xinping Guan, 2015. "A Time-Efficient Convergecast Scheduling on Star-Linear IWSN for Narrow Process Industries," International Journal of Distributed Sensor Networks, , vol. 11(5), pages 123062-1230, May.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:5:p:123062
    DOI: 10.1155/2015/123062
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1155/2015/123062?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:5:p:123062. 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.