{'fraction_non_alphanumeric': 0.012569832402234637, 'fraction_numerical': 0.0, 'mean_word_length': 5.2894736842105265, '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}}
Efficient detection of compromised nodes in a wireless sensor network

Wireless Sensor Networks are networks composed of hundreds or thousands of small sensors which are often placed in hostile environments to sense a particular event in that environment. Unfortunately sensors are characterized by low power, limited memory and low bandwidth. The network is vulnerable to attacks, some of which can compromise a node, which can render the network useless if not detected. Current algorithms which detect compromised nodes do so at a high computational cost. This paper introduces a centralized approach to identifying compromised nodes at a low computational cost. Simulations are conducted to verify the algorithm.