{'fraction_non_alphanumeric': 0.024334600760456272, 'fraction_numerical': 0.0, 'mean_word_length': 5.748717948717949, '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}}
Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Energy efficiency in wireless sensor networks (WSN) is one of the most critical issue regardless of the target application. While scheduling sensors by partitions to preserve energy is a simple and intuitive approach in this context, it is also important to not compromise on the main performance requirements of the considered application. For mission-critical WSN applications, different quality of service (QoS) requirements on network performance have to be met. Besides, various assumptions, may effectively impact the sensing performance capabilities of the network. Nevertheless, most analysis techniques focus on the average performance values, and do not consider neither the targeted QoS requirements, nor the probabilistic feature of the algorithm. Based on the theorem proving approach, we first provide, in this paper, an accurate formal analysis of the network lifetime maximisation problem, under QoS constraints, for randomly-scheduled wireless sensor networks. After that, we tackle the higher-order-logic formalisation of the intrusion coverage intensity, for a modified version of the randomised scheduling, with more realistic assumptions for the intrusion object, in a two or three dimensional plane.