{'fraction_non_alphanumeric': 0.016105417276720352, 'fraction_numerical': 0.0, 'mean_word_length': 5.162162162162162, '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 GA-based approach for fault tolerant relay node placement in wireless sensor networks

In this paper, we address the problem of relay node placement in hierarchical wireless sensor networks. Given a set of potential positions, the basic goal is to minimize the number of relay nodes to be placed and maximize the connectivity between the sensor nodes and the relay nodes to employ fault tolerance of the wireless sensor networks. We present a linear programming (LP) formulation for the stated problem and propose a GA (Genetic Algorithm) based relay node placement algorithm. The proposed algorithm is simulated extensively to demonstrate the superiority over existing algorithms.