Time Slotted Channel Hopping Networks Research Articles

Decentralized Configuration of TSCH-Based IoT Networks for Distinctive QoS: A Deep Reinforcement Learning Approach

The IEEE 802.15.4 Time-Slotted Channel Hopping (TSCH) is widely used as a reliable, low-power, and low-cost communication technology for many industrial Internet-of-Things (IoT) networks. In many applications, Quality-of-Service (QoS) requirements are different for heterogeneous nodes, necessitating non-equal parameter settings per node. This results in a very large configuration space making space exploration complex and time-consuming. Moreover, network state and QoS requirements may change over time. Thus, run-time configuration mechanisms are needed for making decisions about proper node settings to consistently satisfy diverse and dynamic QoS requirements. In this paper, we propose a run-time decentralized self-optimization framework based on Deep Reinforcement Learning (DRL) for parameter configuration of a multi-hop TSCH network. DRL adopts neural networks as approximate functions to speed up the process of converging to QoS-satisfying configurations. Simulation results show that our proposed framework enables the network to use the right configuration settings according to the diverse QoS demands of different nodes. Moreover, it is shown that the convergence time of the learning framework is in the order of a few minutes which is acceptable for many IoT applications.

Time Hopping: An Efficient Technique for Reliable Coexistence of TSCH-Based IoT Networks

Escalation in the use of Internet-of-Things (IoT) devices gives rise to the number of networks operating in the license-free 2.4 GHz frequency band. This prepares the ground for networks to experience interference from coexisting networks and thus performance degradation. Time Slotted Channel Hopping (TSCH), as an operational medium access mode of the IEEE 802.15.4 technology, was introduced to ensure the reliability of IoT networks when they undergo coexistence. It uses frequency hopping as a protective strategy against long-term packet losses due to interference. However, when several independent TSCH networks coexist, they are prone to interfere with one another. In extreme scenarios, coexisting TSCH networks may block links of one another for an extended duration of time, leading to application failure. In this paper, we propose a novel technique called time hopping to secure the reliability of coexisting TSCH networks. The developed technique synchronously and periodically alters the timing of nodes within a TSCH network to avoid coexisting TSCH networks from getting stuck in extreme coexistence scenarios and long-term continuous collisions. We evaluate the effectiveness of the proposed technique through extensive simulations. The results clearly show that the proposed time hopping technique substantially improves the worst-case inter-network collision ratio, with as much as 50% improvement in some tested scenarios. The implementation of the technique is very simple, with almost no communication or computation overhead for the constrained wireless nodes; it is done and tested on real nodes for proof of concept.

Contention-Based Proportional Fairness (CBPF) Transmission Scheme for Time Slotted Channel Hopping Networks

Time slotted channel hopping (TSCH) is a mediumaccess control (MAC) protocol introduced in IEEE802.15.4e standard, addressing low-power requirements of the Internet of Things and low-power and lossy networks. The 6TiSCH operation (6top) sublayer of IEEE802.15.4e defines the schedule that includes sleep, transmit, and receive routines of the nodes. However, the standard does not specify the design of the schedule. In this article, we propose a contention-based proportional fairness transmission scheme for TSCH networks to maximize the system throughput addressing the fair allocation of resources to the nodes. We propose a convex programming-based method to achieve the fairness and throughput objectives. We model TSCH MAC as a multichannel slotted ALOHA and analyze it for a schedule given by the 6top layer. Performance metrics, such as throughput, delay, and energy spent per successful transmission, are derived and validated through simulations and real-time testbed implementations.

Experimental Evaluation of the Layered Flow-Based Autonomous TSCH Scheduler

The Industrial Internet of Things (IIoT) requires wireless connectivity that meets the strict industrial requirements on metrics such as reliability and latency. Promising approaches include Time Slotted Channel Hopping (TSCH) media access, where nodes operate according to a schedule. Autonomously built schedules typically rely on shared resources, where reliability and latency may suffer depending on traffic scenarios and topologies. We have earlier proposed the Layered scheduler, which belongs to a new category of autonomous schedulers: Flow-based scheduling. Layered allocates resources to traffic flows, and as opposed to typical autonomous schedulers, dedicated resources are guaranteed to be scheduled at every hop from source to destination in a convergecast scenario. In addition, Layered minimizes the number of channels required through the novel employment of autonomous spatial reuse. We extend earlier theoretical analysis and simulations by evaluating Layered using the FIT IoT-LAB testbed and compare it to Orchestra and 6TiSCH Minimal scheduler. The experiments demonstrate the feasibility of spatial reuse and that Layered retains performance independent of network topology and traffic intensity - a desirable feature in industrial scenarios. The performance comes at the expense of energy consumption, which in the worst case is 75 % higher compared to Orchestra and Minimal. We also present lessons learned, such as the impact of TSCH configuration on RPL convergence, the benefits of black-listing on performance, and how co-located TSCH networks could be divided by channel offsets as opposed to physical channels. Lastly, we discuss flow-based scheduling in general, its properties, and future research areas.

Resource Allocation in Time Slotted Channel Hopping (TSCH) Networks Based on Phasic Policy Gradient Reinforcement Learning

The concept of the Industrial Internet of Things (IIoT) is gaining prominence due to its low-cost solutions and improved productivity of manufacturing processes. To address the ultra-high reliability and ultra-low power communication requirements of IIoT networks, Time Slotted Channel Hopping (TSCH) behavioral mode has been introduced in IEEE 802.15.4e standard. Scheduling the packet transmissions in IIoT networks is a difficult task owing to the limited resources and dynamic topology. In IEEE 802.15.4e TSCH, the design of the schedule is open to implementation. In this paper, we propose a phasic policy gradient (PPG) based TSCH schedule learning algorithm. We construct the utility function that accounts for the throughput, and energy efficiency of the TSCH network. The proposed PPG based scheduling algorithm overcomes the drawbacks of totally distributed and totally centralized deep reinforcement learning-based scheduling algorithms by employing the actor–critic policy gradient method that learns the scheduling algorithm in two phases, namely policy phase and auxiliary phase. In this method, we show that the schedule converges quickly compared to any other actor–critic method and also improves the system throughput performance by 58% compared to the minimal scheduling function, a default TSCH schedule.

Deep Learning-Based Scheduling Scheme for IEEE 802.15.4e TSCH Network

IEEE 802.15.4e time-slotted channel hopping (TSCH) is one of the most reliable resources of the Industrial Internet of Things (IIoT). TSCH operates on the slot-frame structure consisting of multiple channel-offsets and multiple slot-offsets. It is gaining acceptance due to its simple architecture and consume low power in industrial applications. The performance of TSCH is mainly dominated by the media access control (MAC) mechanism, which covers the refitment, enumeration, composition, and data transmission. However, in many cases, the data transmission schedules are not accurately prescribed. Therefore, most researchers are trying to define many pragmatic scenarios of scheduling. Their fundamental approach is to schedule TSCH network in a centralized way while framing scheduling based on network performance such as throughput and delay. In this work, a deep learning (DL)-based scheme has been proposed. TSCH network schedules for links to cell assignment of a slot-frame can be constructed as a maximum edge weighted bipartite matching approach. In this paper, we design bipartite edge weight to be composed of throughput and delay, and we use the Hungarian algorithm for proper cell assignment. With the Hungarian scheduling algorithm, we generate the training data and train a deep neural network (DNN) accordingly. In the simulation, we consider a simple TSCH network with 5 nodes where 12 links are formulated, and we consider 16 cells for the link assignment. The simulation results show that the proposed deep learning-based scheduling scheme can provide performance similar to the Hungarian algorithm-based scheduling scheme with above 90% accuracy and nearly 80% execution time reduction.

DualBlock: Adaptive Intra-Slot CSMA/CA for TSCH

IEEE 802.15.4 Time-Slotted Channel Hopping (TSCH) has drawn significant attention as a low-power network solution for the Internet of Things (IoT). To make the TSCH scalable and robust, slot scheduling is an important issue that needs to be addressed. The research community has made significant strides with various autonomous or decentralized technologies in recent years. While these techniques try to provide non-overlapped slots for each link, they take collision for granted when multiple links utilize the same slot. In this paper, we challenge the perspective, investigate what happens <i>within</i> a TSCH slot, and find room for performance improvement even when multiple links unfortunately share a slot. To this end, we propose <i>DualBlock</i> that provides another chance for collision avoidance when multiple links try to utilize a slot at the same time by enabling clear channel assessment (CCA) and random backoff <i>within</i> the congested slot. In addition, given that the intra-slot backoff consumes more energy, a control mechanism is added that adjusts maximum backoff by monitoring network congestion level. <i>DualBlock</i> operates in a distributed manner for scalability. Extensive experiments demonstrate that TSCH networks achieve significant performance improvement in many aspects when <i>DualBlock</i> is combined with a scheduler (i.e., Orchestra), up to 3.6 times higher packet delivery ratio and 75% less radio duty cycle.

A Survey of 802.15.4 TSCH Schedulers for a Standardized Industrial Internet of Things.

Concepts such as Industry 4.0 and Cyber-Physical Systems may bring forward a new industrial revolution. These concepts require extensive connectivity far beyond what is provided by traditional industrial networks. The Industrial Internet of Things (IIoT) bridges this gap by employing wireless connectivity and IP networking. In order for wireless networks to meet the strict requirements of the industrial domain, the Time Slotted Channel Hopping (TSCH) MAC is often employed. The properties of a TSCH network are defined by the schedule, which dictates transmission opportunities for all nodes. We survey the literature for these schedulers, describe and organize them according to their operation: Centralized, Collaborative, Autonomous, Hybrid, and Static. For each category and the field as a whole, we provide a holistic view and describe historical trends, highlight key developments, and identify trends, such as the attention towards autonomous mechanisms. Each of the 76 schedulers is analyzed into their common components to allow for comparison between schedulers and a deeper understanding of functionality and key properties. This reveals trends such as increasing complexity and the utilization of centralized principles in several collaborative schedulers. Further, each scheduler is evaluated qualitatively to identify its objectives. Altogether this allows us to point out challenges in existing work and identify areas for future research, including fault tolerance, scalability, non-convergecast traffic patterns, and hybrid scheduling strategies.

RAST: Rapid and energy-efficient network formation in TSCH-based Industrial Internet of Things

The Time Slotted Channel Hopping (TSCH) mode of the IEEE 802.15.4 standard is expected to revolutionize the Industrial Internet of Things. Indeed, it can achieve high reliability and deterministic latency with a very low duty cycle. Nevertheless, forming a TSCH network with the standard approach might not be as efficient, constituting, thus, one of the TSCH’s major issues. Such a network formation process relies on nodes passively scanning for advertised Enhanced Beacon (EB) frames to join the network. Doing so, a node wishing to join a TSCH network may stay awake randomly scanning for EBs for a considerable period of time, leading to a lengthy formation process with excessive energy consumption. To deal with these issues, this paper presents a practical and effective Radio duty-cycled, Active-Scan based network formation process for TSCH networks (RAST). Our proposal leans on active-scan procedures combined with radio duty cycling mechanisms to shorten joining delays and reduce energy consumption. Obtained results from extensive and realistic simulations show that our solution is efficient and outperforms state-of-the-art solutions, regarding the association time and energy consumption by up to two orders of magnitude.

TSCH Evaluation under Heterogeneous Mobile Scenarios

Time Slotted Channel Hopping (TSCH) is a medium access protocol defined in the IEEE 802.15.4 standard. It has proven to be one of the most reliable options when it comes to industrial applications. TSCH offers a degree of high flexibility and can be tailored to the requirements of specific applications. Several performance aspects of TSCH have been investigated so far, such as the energy consumption, reliability, scalability and many more. However, mobility in TSCH networks remains an aspect that has not been thoroughly explored. In this paper, we examine how TSCH performs under mobility situations. We define two mobile scenarios: one where autonomous agriculture vehicles move on a predefined trail, and a warehouse logistics scenario, where autonomous robots/vehicles and workers move randomly. We examine how different TSCH scheduling approaches perform on these mobility patterns and when a different number of nodes are operating. The results show that the current TSCH scheduling approaches are not able to handle mobile scenarios efficiently. Moreover, the results provide insights on how TSCH scheduling can be improved for mobile applications.

Dynamic Programming based Low-Latency Schedule (DPLLS) for 6TiSCH networks

Internet of Things (IoT) is a technological concept bringing sustainability and sophistication to our lives and is a significant component of Industry 4.0. The main requirements of Industrial IoT are reliability, stringent latency and energy efficiency. The IEEE 802.15.4e standard has adapted a Medium Access Control (MAC) behavioural mode called Time Slotted Channel Hopping (TSCH) to address the requirements of Industry 4.0. The 6TiSCH (IPv6 over IEEE 802.15.4e TSCH) protocol stack enables us to schedule the transmissions in TSCH network to achieve application-specific guarantees. In this paper, we propose DPLLS, a conflict-free dynamic programming based low-latency scheduling algorithm for TSCH network. In particular, identifying non-interfering transmissions in the network is posed as a maximum weight independent set (MWIS) problem, which is solved using a dynamic programming method. We organise each slotframe into smaller parts called blocks in which the non-interfering transmissions are scheduled simultaneously using either a conservative or a greedy scheme. The blocks are repeated in a slotframe to accommodate the retransmissions of packets to ensure reliability and minimise the latency. The proposed scheme is evaluated using an example to find the suitable block length of the proposed schemes and compared with the existing scheduling algorithms.

Coexistence Analysis of Co-Located BLE and IEEE 802.15.4 TSCH Networks

Bluetooth Low Energy (BLE) and IEEE 802.15.4 Time-Slotted Channel Hopping (TSCH) are widely used low-power standard technologies developed for short-range communications in the internet-of-things. In many applications, BLE and TSCH networks may be deployed in the vicinity of one another, which may lead to Cross Technology Interference (CTI) influencing each other's performance. Both technologies utilize channel hopping to alleviate the impact of external interferences. However, having a model to quantitatively estimate the performance of coexisting TSCH and BLE networks and analyze the role of networks' configuration settings is still an open problem. To address this, we provide a probabilistic analysis of collision-free communication of coexisting BLE and TSCH networks. Moreover, a fast coexistence simulation model is developed that computes the ratio of collision-free transmissions. This model is used to investigate how the performance of the coexisting networks may deviate from the results of the probabilistic analysis. It gives the designers a proper estimation of the worst case performance degradation due to such coexistence. It is shown that severity of the impact of coexisting BLE-TSCH networks on one another depends on the setup configurations and the relative timing of the two networks. The results show that these two technologies can coexist well with collision-free ratios of more than 92.58% and 96.29% in the tested configurations for TSCH and BLE, respectively.

OSCAR: An Optimized Scheduling Cell Allocation Algorithm for Convergecast in IEEE 802.15.4e TSCH Networks.

Today’s wireless sensor networks expect to receive increasingly more data from different sources. The Time Slotted Channel Hopping (TSCH) protocol defined in the IEEE 802.15.4-2015 version of the IEEE 802.15.4 standard plays a crucial role in reducing latency and minimizing energy consumption. In the case of convergecast traffic, nodes close to the root have consistently heavy traffic and suffer from severe network congestion problems. In this paper, we propose OSCAR, an novel autonomous scheduling TSCH cell allocation algorithm based on Orchestra. This new design differs from Orchestra by allocating slots according to the location of the node relative to the root. The goal of this algorithm is to allocate slots to nodes according to their needs. This algorithm manages the number of timeslots allocated to each node using the value of the rank described by the RPL routing protocol. The goal is that the closer the node is to the root, the more slots it gets in order to maximize the transmission opportunities. To avoid overconsumption, OSCAR sets up a mechanism to adjust the radio duty cycle of each node by reducing the slots allocated to inactive nodes regardless of their position in the network. We implement OSCAR on Contiki-ng and evaluate its performance by both simulations and experimentation. The performance assessment of OSCAR shows that it outperforms Orchestra on the average latency and reliability, without significantly increasing the average duty cycle, especially when the traffic load is high.

Slot Bonding for Adaptive Modulations in IEEE 802.15.4e TSCH Networks

The numerous applications of industrial automation have always posed many challenges for wireless connectivity. In the last decade, IEEE 802.15.4e time-slotted channel hopping (TSCH) networks have provided high reliability and low-power operation in such challenging industrial environments. Typically, TSCH networks employ one modulation at the physical layer and are thus limited by the characteristics of the chosen modulation in terms of, among others, data rate, reliability and energy efficiency. To tackle these limitations and to improve network performance and flexibility in those challenging industrial environments, this work explores the simultaneous use of multiple modulations in a TSCH network. Traditionally, TSCH relies on fixed-duration slots, large enough to send a packet of any size given the fixed data rate. In order to avoid wasting airtime when simultaneously using modulations with different data rates, we propose the concept of slot bonding. This allows the creation of different-sized bonded slots with a duration adapted to the data rate of each chosen modulation. To analyze the proposed slot bonding technique, we formally describe the TSCH slot bonding problem in terms of optimizing the packet delivery ratio while minimizing radio on time, with the inclusion of parent selection and interference avoidance. Afterward, we propose a genetic algorithm that allows us to implement the problem and find solutions heuristically. Finally, we provide insights into preferred parent selection and modulation configurations by using this heuristic approach during extensive simulation experimentation in which the scalability advantage of slot bonding over longer fixed-duration slots is also shown.

Slot Reallocation and Rejection for Collision Avoidance in Autonomous TSCH Networks

The IEEE 802.15.4-2015 TSCH (Time Slotted Channel Hopping) standard provides high-reliability, deterministic delay, and energy efficiency with the channel hopping and the TDMA. The standard does not specify the scheduling method, which is an essential part of the solution. One of the representative studies in TSCH scheduling is Orchestra. It is an autonomous scheduling method with minimal overhead that does not require a negotiation process between nodes. However, with high traffic load, performance of the Orchestra is greatly degraded because of its fixed schedule. If a node has children, continuous collisions occur in the slot of the node. We propose a novel algorithm called SRCA (Slot Reallocation for Collision Avoidance), as a solution for this problem. The SRCA autonomously updates the schedule. When a child requests a slot reallocation, the parent allocates a new slot with a low probability of collision. Another algorithm called SJCA (Slot reJection for Collision Avoidance) is further proposed in this work. It improves the SRCA to operate in an environment with interference where a sending node can disturb a transmission from a hidden node. In the SJCA, a node determines whether a collision due to interference will occur in the slot newly allocated by the parent. If so, it rejects the slot and requests again. We compare the performance of the SRCA and the SJCA against the Orchestra and e-TSCH-Orch through simulations. It is confirmed that the SJCA is robust to interference. In most cases, the SJCA shows better performance of PAR (Packet Acknowledgement Ratio), PLR (Packet Loss Rate), and latency than others. It is also verified that the SJCA provides high-reliability and low latency compared to existing technologies.

Towards Improving TSCH Energy Efficiency: An Analytical Approach to a Practical Implementation.

The IEEE 802.15.4-2015 standard defines a number of Medium Access Control (MAC) layer protocols for low power wireless communications, which are desirable for energy-constrained Internet of Things (IoT) devices. Originally defined in the IEEE 802.15.4e amendment, the Time Slotted Channel Hopping (TSCH) has recently been attracting attention from the research community due to its reduced contention (time scheduling) and robustness against fading (channel hopping). However, it requires a certain level of synchronization between the nodes, which can increase the energy consumption. In this work, we implement the Guard Beacon (GB) strategy, aiming at reducing the guard time usually implemented to compensate for imperfect synchronization. Moreover, besides presenting a realistic energy consumption model for a Contiki Operating System-based TSCH network, we show through analytical and practical results that, without the proposed scheme, the power consumption can be more than 13% higher.

Adaptive multi-PHY IEEE802.15.4 TSCH in sub-GHz industrial wireless networks

To provide wireless coverage in challenging industrial environments, IEEE802.15.4 Time-Slotted Channel Hopping (TSCH) presents a robust medium access protocol. Using multiple Physical Layers (PHYs) could improve TSCH even more in these heterogeneous environments. However, TSCH only defines one fixed-duration timeslot structure allowing one packet transmission. Using multiple PHYs with various data rates therefore does not yield any improvements because of this single-packet limitation combined with a fixed slot duration. We therefore defined two alternative timeslot structures allowing multiple packets transmissions to increase the throughput for higher data rate PHYs while meeting a fixed slot duration. In addition, we developed a flexible Link Quality Estimation (LQE) technique to dynamically switch between PHYs depending on the current environment. This paper covers a theoretical evaluation of the proposed slot structures in terms of throughput, energy consumption and memory constraints backed with an experimental validation, using a proof-of-concept implementation, which includes topology and PHY switching. Our results show that a 153% higher net throughput can be obtained with 84% of the original energy consumption and confirm our theoretical evaluation with a 99% accuracy. Additionally, we showed that in a real-life testbed of 33 nodes, spanning three floors and covering 2550m2, a compact multi-PHY TSCH network can be formed. By distinguishing between reliable and high throughput PHYs, a maximum hop count of three was achieved with a maximum throughput of 219kbps. Consequently, using multiple (dynamic) PHYs in a single TSCH network is possible while still being backwards compatible to the original fixed slot duration TSCH standard.

TSCH-Sim: Scaling Up Simulations of TSCH and 6TiSCH Networks.

TSCH (Time-Slotted Channel Hopping) and 6TiSCH (IPv6 over the TSCH mode of IEEE 802.15.4e) low-power wireless networks are becoming prominent in the industrial Internet of Things (IoT) and other areas where high reliability is needed in conjunction with energy efficiency. Due to the complexity of IoT deployments, network simulations are typically used for pre-deployment design and validation. However, it is currently difficult and time-consuming to simulate large-scale IoT networks with thousands of nodes. This paper proposes TSCH-Sim: a new discrete event simulator for IEEE 802.15.4-2015 TSCH and 6TiSCH networks. The evaluation shows that simulation results obtained with TSCH-Sim show a good match with results from other simulators that are commonly used to investigate TSCH networks. At the same time, TSCH-Sim is faster than these alternatives at least by an order of magnitude, making it more practical to carry out simulations of large networks.

An improved fast transform algorithm based on adaptive hybrid channel allocation in TSCH networks

Time Slotted Channel Hopping (TSCH) is one of the five access behavior technologies defined in the IEEE 802.15.4e standard. Research shows that the wireless sensor network with single dynamic and static channel allocation in TSCH mode has higher performance. The clogging rate results in unnecessary energy waste. Therefore, this paper proposes an adaptive hybrid channel allocation strategy (AHCA) to measure the link quality change of wireless sensor networks in TSCH mode. The strategy estimates the part of the channel quality and determines whether the node wants to transmit on this channel and the optimal channel for node information transmission. According to the change of the amount of information transmitted, the hybrid channel allocation scheme of the dynamic and static channel ratio is adaptively adjusted to reduce the energy consumption of the information transmission process. This article performs experimental simulation on Contiki-NG. The experimental results show that the proposed scheme has shorter transmission time and lower congestion rate than the single dynamic static channel allocation wireless sensor network. The more reasonable and effective measurement, analysis and use of channel resources can fundamentally increase the amount of information transfer in wireless sensor networks per unit time, and thus extend the lifetime of wireless sensor networks.

TLSA: A Two Level Scheduling Algorithm for Multiple packets Arrival in TSCH Networks

Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered. At the first stage, the packets are considered to be of higher priority. At the second stage, the packets are considered to be of lower priority. We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y=eax -1 and y=0.5x2 using MATLAB 2017a software for the computation of average and worst ratios of the two levels.