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

Optimal Convergecast Scheduling Limits for Clustered Industrial Wireless Sensor Networks

Author

Listed:
  • Xiaoling Zhang
  • Wei Liang
  • Haibin Yu
  • Xisheng Feng

Abstract

Increased mobility coupled with a possible reduction of cabling costs and deployment time makes wireless communication an attractive alternative for the industrial process monitoring and control. The major obstacles toward the utilization of wireless industrial networks are predominantly the timeliness and reliability requirements. In this paper, orienting to clustered industrial wireless sensor networks, we analyze the performance bounds of the convergecast scheduling, which is a typical many-to-one communication in wireless industrial networks. The analysis aims to the cluster-line and cluster-tree topologies. Each kind is future divided into three scenarios according to an application parameter, named data update rate. Firstly, we establish the lower bounds on the number of timeslots to finish the intracluster and the intercluster convergecast transmissions. Secondly, we establish the lower bounds on the number of channels based on the lower bounds on the number of timeslots and maximum available channels in a multichannel scenario. Lastly, we carry out the extensive analysis-taking packet retransmissions into consideration so as to meet the reliability requirement. Experiment results validate the correctness and tightness of our theory analysis.

Suggested Citation

  • Xiaoling Zhang & Wei Liang & Haibin Yu & Xisheng Feng, 2012. "Optimal Convergecast Scheduling Limits for Clustered Industrial Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(11), pages 891321-8913, November.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:11:p:891321
    DOI: 10.1155/2012/891321
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/891321
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/891321?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:8:y:2012:i:11:p:891321. 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.