{'fraction_non_alphanumeric': 0.018055555555555554, 'fraction_numerical': 0.0, 'mean_word_length': 4.741035856573705, '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}}
Budget constrained relay node placement problem for maximal “connectedness”

The relay node placement problem in the wireless sensor network have been studied extensively in the last few years. The goal of most of these problems is to place the fewest number of relay nodes in the deployment area so that the network formed by the sensors nodes and the relay nodes is connected. Most of these studies are conducted for the unconstrained budget scenario, in the sense that there is an underlying assumption that no matter however many relay nodes are needed to make the network connected, they can be procured and deployed. However, in a fixed budget scenario, the expenses involved in procuring the minimum number of relay nodes to make the network connected may exceed the budget. Although in this scenario, one has to give up the idea of having a network connecting all the sensor nodes, one would still like to have a network with high level of “connectedness”. In the paper we introduce two metrics for measuring “connectedness” of a disconnected graph and study the problem whose goal is to design a network with maximal “connectedness”, subject to a fixed budget constraint. We show that both versions of the problem are NP-complete and provide heuristics for their solution. We show that the problem is non-trivial even when the number of sensor nodes is as few as three. We evaluate the performance of heuristics through simulation.