Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks
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 indu...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-10-01
|
| Series: | Energies |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1996-1073/14/19/6370 |
| _version_ | 1797516591524478976 |
|---|---|
| author | Myung-Kyun Kim |
| author_facet | Myung-Kyun Kim |
| author_sort | Myung-Kyun Kim |
| collection | DOAJ |
| description | 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). |
| first_indexed | 2024-03-10T07:03:03Z |
| format | Article |
| id | doaj.art-9cfed7c980f449d2b04873fae710dee6 |
| institution | Directory Open Access Journal |
| issn | 1996-1073 |
| language | English |
| last_indexed | 2024-03-10T07:03:03Z |
| publishDate | 2021-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Energies |
| spelling | doaj.art-9cfed7c980f449d2b04873fae710dee62023-11-22T16:03:22ZengMDPI AGEnergies1996-10732021-10-011419637010.3390/en14196370Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor NetworksMyung-Kyun Kim0Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Daehak-ro 93, Nam-gu, Ulsan 44610, KoreaThe 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).https://www.mdpi.com/1996-1073/14/19/6370IEEE 802.15.4eindustrial wireless sensor networks (IWSNs)link schedulingqueue estimationreliability in IWSNs |
| spellingShingle | Myung-Kyun Kim Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks Energies IEEE 802.15.4e industrial wireless sensor networks (IWSNs) link scheduling queue estimation reliability in IWSNs |
| title | Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks |
| title_full | Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks |
| title_fullStr | Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks |
| title_full_unstemmed | Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks |
| title_short | Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks |
| title_sort | efficient link scheduling based on estimated number of packets in queue on industrial wireless sensor networks |
| topic | IEEE 802.15.4e industrial wireless sensor networks (IWSNs) link scheduling queue estimation reliability in IWSNs |
| url | https://www.mdpi.com/1996-1073/14/19/6370 |
| work_keys_str_mv | AT myungkyunkim efficientlinkschedulingbasedonestimatednumberofpacketsinqueueonindustrialwirelesssensornetworks |