{'fraction_non_alphanumeric': 0.024916943521594685, 'fraction_numerical': 0.0, 'mean_word_length': 5.085858585858586, '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 localization algorithm based on compressive sensing by K-nearest Neighbor classification

In this paper, we propose a novel framework of localization algorithm based on Compressive Sensing (CS) by K-Nearest Neighbor (KNN) classification in Wireless Sensor Networks (WSNs), which can effectively alleviate the problem of off-grid. Many papers about CS-based localization assume that each target is in the center of the grid. However, the assumption is almost impossible. In this paper, the targets can be located anywhere in the area. The target location is regarded as an unknown sparse signal in the discrete spatial domain. Practically, the recovered discrete signal is not exactly K-sparse. In order to make high level of localization accuracy, we localize the targets in three different situations and choose the cluster region according to the distribution of the power of the targets. Then for each classification, we obtain the final location by KNN. This approach can make great use of the location information and compensate the error induced by the problem of off-grid. Finally, simulation and performance analysis show the effectiveness and robustness of our proposed localization algorithm.