IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i19p6370-d650248.html
   My bibliography  Save this article

Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks

Author

Listed:
  • Myung-Kyun Kim

    (Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Daehak-ro 93, Nam-gu, Ulsan 44610, Korea)

Abstract

The links of low power wireless sensor networks are error prone and the transmission on a wireless link is determined probabilistically by the packet reception rate (PRR) of the link. On the other hand, there is a very strict requirement in the end-to-end reliability and delay of sensor data in industrial wireless sensor networks (IWSNs). The existing approaches to provide the end-to-end reliability in IWSNs is retransmitting the packet when failure occurs. These approaches transmit a packet multiple times in successive time slots to provide the required reliability. These approaches, however, can increase the average delay of packets and the number of packets buffered in a queue. This paper proposes a new scheme to estimate the probabilistic amount of packets, called queue level (QL), in the buffer of each node based on the PRRs of the wireless links. This paper also proposes a QL-based centralized scheduling algorithm to assign time slots efficiently in TDMA-based IWSNs. The proposed scheduling algorithm gives higher priority to the nodes with higher QL. By assigning time slots first to the node with the highest QL, we can reduce the average end-to-end delay of packets and reduce the amount of buffered packets in the queue while satisfying the required end-to-end reliability. The performance of the proposed scheduling algorithm have been evaluated through a simulation using the Cooja simulator and compared with the existing approach. In the simulation on an sample network with the target end-to-end reliability of 99%, all of the flows were shown to guarantee the target reliability in both algorithms: on average, 99.76% in the proposed algorithm and 99.85% in the existing approach. On the other hand, the proposed algorithm showed much better performance than the existing approach in terms of the average end-to-end delay of packets (about 47% less) and the number of maximally buffered packets in the queue of each node (maximally, more than 90% less).

Suggested Citation

  • Myung-Kyun Kim, 2021. "Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks," Energies, MDPI, vol. 14(19), pages 1-12, October.
  • Handle: RePEc:gam:jeners:v:14:y:2021:i:19:p:6370-:d:650248
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/19/6370/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/14/19/6370/
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Wojciech M. Kempa & Dariusz Kurzyk, 2022. "Analysis of Non-Steady Queue-Length Distribution in a Finite-Buffer Model with Group Arrivals and Power Saving Mechanism with Setups," Energies, MDPI, vol. 15(22), pages 1-15, November.

    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:gam:jeners:v:14:y:2021:i:19:p:6370-:d:650248. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.