{'fraction_non_alphanumeric': 0.02001906577693041, 'fraction_numerical': 0.0, 'mean_word_length': 5.441717791411043, '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}}
Replication Schemes in Unattended Wireless Sensor Networks

Unattended Wireless Sensor Networks (UWSNs) are networks that operate without on-line data collection entities (Sink Collectors). This configuration enriches their flexibility but, at the same time, introduces new security issues. A challenging issue is data survival: in absence of the sink, in fact, data sensed by network sensors cannot be kept clear from the adversary. Cryptographic schemes, moreover, cannot be easily implemented: cryptographic material as well as sensed data are continuously exposed to the activity of a smart adversary. Several strategies were proposed in literature which collectively attempt to mitigate this challenge. In this paper we investigate the use of replication as a mean to enhance the survival probability of collected data. We propose a scheme that deterministically grants data survival against a focused mobile adversary. We analyze the behavior of our proposal and study its security and efficiency properties to prove its suitability for UWSNs.