{'fraction_non_alphanumeric': 0.010159651669085631, 'fraction_numerical': 0.0, 'mean_word_length': 5.759803921568627, '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}}
Pairwise key establishment scheme for hypercube-based wireless sensor networks

When designing wireless sensor networks, the process of establishing and distributing the secret keys securely and efficiently is very challenging due to the unpredictable network topology. Recently, hypercube virtual backbone approach has been used to provide efficient data gathering schemes for the wireless sensor networks. The hypercube attractive structure and topological properties provide several disjoint paths between any two nodes which can be utilized to overcome this problem easily and efficiently, In this paper, we propose a novel scheme for pairwise key establishment for wireless sensor networks. The scheme relays on the hypercube virtual backbone and works by generating keys and distributing them securely over multiple disjoint paths which are provided by the hypercube structure. We propose an algorithm for the generation of keys and their distribution through multiple disjoint paths as well as another distributed algorithm to identify the disjoint paths within the virtual hypercube and route the keys securely and efficiently through them. Our scheme has better network resilience against node capture attack. Moreover, it provides more scalability, lower storage overhead as well as lower communication and computational overhead compared to other existing approaches.