{'fraction_non_alphanumeric': 0.025842696629213482, 'fraction_numerical': 0.0, 'mean_word_length': 5.274647887323944, '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}}
Critical-path aware broadcast scheduling in duty-cycled Wireless Sensor Networks

Message broadcasting is an essential and widely-used operation in multi-hop Wireless Sensor Networks (WSNs). Minimum latency broadcast scheduling (MLBS) aims to achieve a schedule to broadcast messages with a minimum latency. In duty-cycle networks, a node alternates between active and sleep states, which causes decrease in energy consumption at the cost of increased broadcast latency. An existing scheme mathematically remodels the MLBS problem for duty-cycled WSNs and proposes a vector integration algorithm to solve the problem. In this paper, we propose a broadcast scheduling scheme by first finding critical-paths in a duty-cycled WSN. By scheduling transmissions with a preference of nodes in the critical-path, the proposed scheme reduces the broadcast latency as shown in the simulation results.