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

Resource scheduling based on routing tree and detection matrix for Internet of things

Author

Listed:
  • Hongying Bai
  • Xiaotong Zhang
  • Yuxin Liu
  • Yingdong Xie

Abstract

Effective scheduling of limited communication resources is one of the critical methods for data transmission in the Internet of things. However, the time slot utilization rate of many existing resource scheduling methods of Internet of things is not high. This article proposes a new efficient resource scheduling based on routing tree and detection matrix for Internet of things. In heterogeneous Internet of things, according to the different working modes and functions, the nodes are divided into Internet of things devices, routing nodes, and base station. We use time slot multiplexing to improve the time slot utilization of continuous transmission in Internet of things. First, the time slot allocation table in a round is obtained by the time slot scheduling based on the routing tree. Then, the collision matrix and the transmission matrix are established based on the time slot allocation table in a round. Finally, the minimum time slot scheduling in continuous rounds is determined based on the routing tree and the detection matrix. The experimental results show that the resource scheduling based on routing tree and detection matrix effectively improves the utilization of time slots and improves the throughput of the Internet of things.

Suggested Citation

  • Hongying Bai & Xiaotong Zhang & Yuxin Liu & Yingdong Xie, 2021. "Resource scheduling based on routing tree and detection matrix for Internet of things," International Journal of Distributed Sensor Networks, , vol. 17(3), pages 15501477211, March.
    • Handle: RePEc:sae:intdis:v:17:y:2021:i:3:p:15501477211003830
    DOI: 10.1177/15501477211003830
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501477211003830
    Download Restriction: no
    File URL: https://libkey.io/10.1177/15501477211003830?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
    ---><---

    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:17:y:2021:i:3:p:15501477211003830. 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.