{'fraction_non_alphanumeric': 0.016145307769929364, 'fraction_numerical': 0.0, 'mean_word_length': 5.012121212121212, '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}}
Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon

Localization is an essential service in wireless sensor networks. Trilateration is a commonly used solution to range-based localization for providing such services. It might be, however, impossible to localize the entire network at once using trilateration due to low connectivity on sparse deployments. In such scenarios, a mobile beacon with a known position is used to move among and locate the nodes with low connectivity to aid trilateration. Given a network graph, finding a minimum energy route traveled by the mobile beacon is a key problem in many real-world applications. We prove in this letter that this problem called mobile assisted trilateration based energy optimum localization is NP-hard. To the best of our knowledge, this is the first such result in an attempt to computationally classify this important problem. We also provide a compact integer linear programming formulation for the problem.