A Fairness-Aware Scheduling Algorithm for Industrial Wireless Sensor Networks with Multiple Access Points

2017 ◽  
Author(s):  
Huaguang Shi ◽  
Meng Zheng ◽  
Wei Liang ◽  
Zhe Luo ◽  
Seung Ho Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Multiple Access ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Industrial Wireless Sensor Networks ◽  
Access Points

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

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6370
Author(s):  
Myung-Kyun Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
The Other ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Industrial Wireless Sensor Networks ◽  
End To End Delay ◽  
Other Hand ◽  
End To End

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).

Sign in / Sign up

Export Citation Format

Share Document