{'fraction_non_alphanumeric': 0.015476190476190477, 'fraction_numerical': 0.0, 'mean_word_length': 6.127118644067797, '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 Node Localization Algorithm for Wireless Sensor Network Based on Compressed Sensing

To obtain better performance and lower error localization algorithms, this paper proposes an algorithm based on Orthogonal Matching Pursuit (OMP) reconstruction and Basis Pursuit (BP) reconstruction algorithm for wireless sensor network node localization in combination with compressed sensing. These two algorithms both belong to the localization algorithm without ranging and meet three conditions when solving the problem of location algorithm which makes them more suitable for practical application. Compared with other existing range-free algorithms, such as the LSVM algorithm, the compressed sensing algorithm has better positioning performance. Therefore, the compressed sensing algorithm is a more reliable and practical positioning algorithm.