{'fraction_non_alphanumeric': 0.026988636363636364, 'fraction_numerical': 0.0, 'mean_word_length': 5.778846153846154, '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}}
Distributed RSS-based localization in wireless sensor networks using convex relaxation

In this paper we address the sensor localization problem in large-scale wireless sensor networks (WSNs) by using the received signal strength (RSS) measurements. Finding the maximum likelihood (ML) estimate involves solving a non-convex optimization problem, thus making the search for the globally optimal solution hard. Based on the second-order cone programming (SOCP) relaxation, two methods which solve the localization problem in a completely distributed manner are proposed. Computer simulations show that the proposed approaches work well in various scenarios, and efficiently solve the localization problem.