{'fraction_non_alphanumeric': 0.027918781725888325, 'fraction_numerical': 0.01015228426395939, 'mean_word_length': 5.129533678756476, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Model-based Beacon Scheduling algorithm for IEEE 802.15.4e TSCH networks

Time Slotted Channel Hopping (TSCH) is an emerging MAC protocol defined in the IEEE 802.15.4e standard. By combining time slotted access with multi-channel and channel hopping capabilities, it is particularly suitable for critical applications that require high reliability and deterministic latency. In this paper we focus on the formation process of TSCH networks. This relies on periodic advertisement of Enhanced Beacons (EBs), however, the standard does not specify any advertising strategy. By taking a theoretical approach, we first derive a general model of the network formation process and provide an analytical formulation of the average joining time (i.e., the time taken by a node to join the network). Then, we derive an optimal strategy for scheduling EB transmissions that minimizes the average joining time. Finally, we propose a new Model-based Beacon Scheduling (MBS) algorithm that approximates the optimal strategy in real networks. We evaluate the performance of MBS by simulation. Our results show that the proposed algorithm outperforms previous solutions present in the literature.