{'fraction_non_alphanumeric': 0.02553626149131767, 'fraction_numerical': 0.0, 'mean_word_length': 4.9393939393939394, '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}}
A Full Connection and Less Memory Usage Scheme for Distributed Sensor Networks

In sensor networks, the rare resources are very important, like the limited computation ability, memory size, energy, and communication bandwidth. In the past, several studies either focus on full connection or reducing the memory usage. In this work, we proposed a novel key management scheme which fulfills power control, less memory usage, and full connection. In our scheme, the sink node first generates a key-generation function, and embeds it into sensor nodes. The sensor nodes are then deployed, and they find their neighboring coordinators to generate a permutation of slice numbers. The permutation is then sent back to the sink node. Based on the permutation, the sink node and the sensor nodes can assemble into a common program for deriving their common key. The proposed scheme is simple, efficient, and secure, if the sensor nodes cannot be compromised within a threshold time bound.