Traffic Aware Scheduler for Time-Slotted Channel-Hopping-Based IPv6 Wireless Sensor Networks

Wireless sensor networks (WSNs) are becoming increasingly prevalent in numerous fields. Industrial applications and natural-disaster-detection systems need fast and reliable data transmission, and in several cases, they need to be able to cope with changing traffic conditions. Thus, time-slotted channel hopping (TSCH) offers high reliability and efficient power management at the medium access control (MAC) level; TSCH considers two dimensions, time and frequency when allocating communication resources. However, the scheduler, which decides where in time and frequency these communication resources are allotted, is not part of the standard. Orchestra has been proposed as a scheduler which allocates the communication resources based on information collected through the IPv6 routing protocol for low-power and lossy networks (RPL). Orchestra is a very elegant solution, but does not adapt to high traffic. This research aims to build an Orchestra-based scheduler for applications with unpredictable traffic bursts. The implemented scheduler allocates resources based on traffic congestion measured for the children of the root and RPL subtree size of the same nodes. The performance analysis of the proposed scheduler shows lower latency and higher packet delivery ratio (PDR) compared to Orchestra during bursts, with negligible impact outside them

Time-Slotted Spreading Factor Hopping for Mitigating Blind Spots in LoRa-Based Networks

It has been demonstrated that LoRa-based wide area networks (WANs) can cover extended areas under harsh propagation conditions. Traditional LoRaWAN solutions based on single-hop access face important drawbacks related to the presence of blind spots. This paper aims to tackle blind spots and performance issues by using a relaying approach. Many researchers investigating multi-hop solutions consider a fixed spreading factor (SF). This simplifies synchronization and association processes, but does not take advantage of the orthogonality between the virtual channels (i.e., frequency, SF) that help to mitigate blind spots. This paper proposes a time-slotted spreading factor hopping (TSSFH) mechanism that combines virtual channels and time slots into a frame structure. Pseudo-random scheduling is used inside blind spots, which simplifies the end-devices’ communication process and network organization. The results show how collisions decrease inside blind spots when more communication opportunities become available as more relaying nodes can be listening in different cells (i.e., frequency, SF-offset, time-offset). This has a direct impact on the collision-free packet delivery ratio (PDR) metric, which improves when more listening windows are opened, at the expense of faster battery depletion