LOST: Localized blacklisting aware scheduling algorithm for IEEE 802.15.4-TSCH networks

Zorbas, Dimitrios; Kotsiou, Vassilis; Théoleyre, Fabrice; Papadopoulos, Georgios Z.; Douligeris, Christos

doi:10.1109/wd.2018.8361705

Cited by 17 publications

(15 citation statements)

References 14 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In almost all previous TSCH scheduling, authors either assume that the impact of link qualities or channel variations on performance are negligible (such as [7][8][9][10][11][12][13][14]), or that the instantaneous and complete channel information is available (such as [15][16][17]), or else the channel is modeled quasi-static (such as [18][19][20]). For example, in [15 and 16], it is assumed that the instantaneous CSI is fully measurable and available, therefore one can use an offline method and calculate the optimal scheduling for a TSCH network by the exact rate of packets to be sent over each link.…”

Section: B Related Workmentioning

confidence: 99%

“…It is clear from their simulation results that in this case superior performance on delay is achieved compared to the investigated solutions. In [19], a distributed scheduling method with local blacklist configuration is proposed for TSCH networks, called LOST. Authors investigated the impact of cell over-provisioning on transmitting a single packet over various link qualities, to identify the minimum required number of cells.…”

Section: B Related Workmentioning

confidence: 99%

“…To the best of our knowledge, there are many studies which present new scheduling methods for TSCH networks without considering the impact of CSI (such as [7][8][9][10][11][12][13][14]). We have seen that in some schemes authors assume that perfect non-causal knowledge of CSI is available for the scheduling process (such as [15][16][17]) and in others prior statistical knowledge of link qualities is utilized in order to improve performance (Such as [18][19][20]). Although such assumptions in earlier scheduling algorithms, where channel status is available or constant, enable mathematical tractability of the scheduling problem, they are not realizable in real-world systems due to the difficulty in predicting random and timevarying wireless channel conditions.…”

Section: Motivationmentioning

confidence: 99%

See 2 more Smart Citations

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

In TSCH, which is a MAC mechanism set of the IEEE 802.15.4e amendment, calculation, construction, and maintenance of the packet transmission schedules are not defined. Moreover, to ensure optimal throughput, most of the existing scheduling methods are based on the assumption that instantaneous and accurate Channel State Information (CSI) is available. However, due to the inevitable errors in the channel estimation process, this assumption cannot be materialized in many practical scenarios. In this paper, we propose two alternative and realistic approaches. In our first approach, we assume that only the statistical knowledge of CSI is available a priori. Armed with this knowledge, the average packet rate on each link is computed and then, using the results, the throughput-optimal schedule for the assignment of (slotframe) cells to links can be formulated as a max-weight bipartite matching problem, which can be solved efficiently using the well-known Hungarian algorithm. In the second approach, we assume that no CSI knowledge (even statistical) is available at the design stage. For this zeroknowledge setting, we introduce a machine learning-based algorithm by formally modeling the scheduling problem in terms of a combinatorial multi-armed bandit (CMAB) process. Our CMAB-based scheme is widely applicable to many real operational environments, thanks to its reduced reliance on design-time knowledge. Simulation results show that the average throughput obtained by the statistical CSIbased method is within the margin of 15% from the theoretical upper bound associated with perfect instantaneous CSI. The aforesaid margin is around 18% for our learning-theoretic solution.Index Terms-IEEE 802.15.4e, TSCH, Scheduling, CSI, CMAB.

show abstract

Section: B Related Workmentioning

confidence: 99%

Section: B Related Workmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

show abstract

“…A bad radio channel is a frequency whose usage increases globally the number of retransmissions and impacts negatively the network reliability [8]. Thus, a bad radio channel exhibits a high number of retransmissions compared to the other ones.…”

Section: A Identifying Bad Radio Channelsmentioning

confidence: 99%

Blacklisting-Based Channel Hopping Approaches in Low-Power and Lossy Networks

et al. 2019

Self Cite

View full text Add to dashboard Cite

More and more industrial applications require high reliability, while relying on low-power devices for their flexibility. Unfortunately, radio transmissions are prone to unreliability, and are very sensitive to external interference. Therefore, a great amount of effort has been put on channel hopping approaches, which help to combat external interference by reducing the number of packet losses. This approach is combined with a strict schedule of the transmissions to allow the devices to save energy. However, some of the radio channels are subjected to strong interference. Blacklisting techniques identify the interfered radio channels that demonstrate low packet delivery radio and avoid using them to transmit data packets. In this article, we study different distributed and global blacklisting techniques and investigate their dependencies on the scheduling algorithm. We also present a new scheme to exploit a blacklist by making the employed scheduling algorithm blacklist-aware. Our results rely on a real experimental dataset to quantify the performance of all these approaches and demonstrate the interest of blacklisting to improve network reliability.

show abstract

“…The above studies [23]- [31] are based on the assumption that all links in an IWSN share the same GACS, and their solutions are always inefficient due to the overlook of the location-dependent characteristics of wireless channels in harsh industrial environment [32]- [34]. Different from [23]- [31], Zorbas et al [35] proposed the first LACSsbased distributed scheduling algorithm which assigned time slots and channels by exchanging information only with the neighbors. However, distributed algorithms are not applicable for IWSNs due to the following two drawbacks: First, without global information, an optimal schedule is hard to obtain for each node, which may result in low utilization of time and channel resources.…”

Section: B Multi-channel Casementioning

confidence: 99%

Convergecast Scheduling for Industrial Wireless Sensor Networks With Local Available Channel Sets

et al. 2019

View full text Add to dashboard Cite

In industrial wireless sensor networks (IWSNs), monitoring data generated by field devices (FDs) are supposed to be delivered to the gateway timely and reliably. The previous researches focus on the convergecast problem based on the global available channel set, where unreliable channels are blacklisted. However, in practical industrial environment, different links may have different local available channel sets (LACSs) due to the location-dependent characteristics of wireless channels. In this paper, we study the LACSs-based convergecast scheduling problem in the IWSNs with tree topologies. First, we formulate the convergecast scheduling problem in a mathematically precise form of integer programming. Then, we propose a novel method to calculate priorities for each FD, and design two effective heuristic rules of allocating channels to FDs to maximize the number of concurrent transmissions in each time slot, considering the priority of each FD and the constraints in the integer programming formulation. Finally, inspired by the proposed heuristic rules, we propose an LACSs-based convergecast scheduling (LCS) algorithms to generate efficient schedules for IWSNs in polynomial time. The simulation results show that the proposed algorithm outperforms existing works in terms of latency for different scenarios. Index Terms-Industrial wireless sensor networks, convergecast scheduling, available channel sets, real-time, channel blacklisting. I. INTRODUCTION A S one of the most critical technologies for intelligent manufacturing, industrial wireless sensor networks (IWSNs) are being widely adopted in smart factories [1]-[3].

show abstract

LOST: Localized blacklisting aware scheduling algorithm for IEEE 802.15.4-TSCH networks

Cited by 17 publications

References 14 publications

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

Blacklisting-Based Channel Hopping Approaches in Low-Power and Lossy Networks

Convergecast Scheduling for Industrial Wireless Sensor Networks With Local Available Channel Sets

Contact Info

Product

Resources

About