{'fraction_non_alphanumeric': 0.020610057708161583, 'fraction_numerical': 0.004122011541632316, 'mean_word_length': 5.526881720430108, '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}}
Scalable Channel Allocation and Access Scheduling for Wireless Internet-of-Things

Wireless communication channels are a scarce resource shared among multiple users in either scheduled or randomized fashions. We challenge a few design aspects of the widely used IEEE 802.11 MAC in wireless sensor networks (WSNs), such as the use of RTS, CTS, and ACK handshaking and the binary exponential backoff mechanisms, and argue that these key mechanisms incur high channel overhead and cannot effectively eliminate hidden terminal problems in multi-hop scenarios. Instead, we propose a set of efficient grid-based channel allocation and access scheduling algorithms using Latin squares, called as GAALS, for scalable WSNs with single-radio multi-channel communication capabilities. Using nodal location information and forming grids over the WSN deployment area, GAALS maps Latin squares to the grids, and dynamically assigns multiple channels to the WSN grids for channel access scheduling purposes. The fairness and scalability of GAALS are analyzed and evaluated in multiflow multihop WSNs with multi-channel capabilities. The results show that GAALS achieves much better performance than other multichannel protocols.