TSCH Multiflow Scheduling with QoS Guarantees: A Comparison of SDN with Common Schedulers

Industrial Wireless Sensor Networks (IWSN) are becoming increasingly popular in production environments due to their ease of deployment, low cost and energy efficiency. However, the complexity and accuracy demanded by these environments requires that IWSN implement quality of service mechanisms that allow them to operate with high determinism. For this reason, the IEEE 802.15.4e standard incorporates the Time Slotted Channel Hopping (TSCH) protocol which reduces interference and increases the reliability of transmissions. This standard does not specify how time resources are allocated in TSCH scheduling, leading to multiple scheduling solutions. Schedulers can be classified as autonomous, distributed and centralised. The first two have prevailed over the centralised ones because they do not require high signalling, along with the advantages of ease of deployment and high performance. However, the increased QoS requirements and the diversity of traffic flows that circulate through the network in today’s Industry 4.0 environment require strict, dynamic control to guarantee parameters such as delay, packet loss and deadline, independently for each flow. That cannot always be achieved with distributed or autonomous schedulers. For this reason, it is necessary to use centralised protocols with a disruptive approach, such as Software Defined Networks (SDN). In these, not only is the control of the MAC layer centralised, but all the decisions of the nodes that make up the network are configured by the controller based on a global vision of the topology and resources, which allows optimal decisions to be made. In this work, a comparative analysis is made through simulation and a testbed of the different schedulers to demonstrate the benefits of a fully centralized approach such as SDN. The results obtained show that with SDN it is possible to simplify the management of multiple flows, without the problems of centralised schedulers. SDN maintains the Packet Delivery Ratio (PDR) levels of other distributed solutions, but in addition, it achieves greater determinism with bounded end-to-end delays and Deadline Satisfaction Ratio (DSR) at the cost of increased power consumption.

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

Multihop Latency Model for Industrial Wireless Sensor Networks Based on Interfering Nodes

Emerging Industry 4.0 applications require ever-increasing amounts of data and new sources of information to more accurately characterize the different processes of a production line. Industrial Internet of Things (IIoT) technologies, and in particular Wireless Sensor Networks (WSNs), allow a large amount of data to be digitized at a low energy cost, thanks to their easy scalability and the creation of meshed networks to cover larger areas. In industry, data acquisition systems must meet certain reliability and robustness requirements, since other systems such as predictive maintenance or the digital twin, which represents a virtual mapping of the system with which to interact without the need to alter the actual installation, may depend on it. Thanks to the IEEE 802.15.4e standard and the use of Time-Slotted Channel Hopping (TSCH) as the medium access mechanism and IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) as the routing protocol, it is possible to deploy WSNs with high reliability, autonomy, and minimal need for re-configuration. One of the drawbacks of this communication architecture is the low efficiency of its deployment process, during which it may take a long time to synchronize and connect all the devices in a network. This paper proposes an analytical model to characterize the process for the creation of downstream routes in RPL, whose transmission of multi-hop messages can present complications in scenarios with a multitude of interfering nodes and resource allocation based on minimal IPv6 over the TSCH mode of IEEE 802.15.4e (6TiSCH). This type of multi-hop message exchange has a different behaviour than the multicast control messages exchanged during the synchronization phase and the formation of upstream routes, since the number of interfering nodes changes in each retransmission.