{'fraction_non_alphanumeric': 0.012359550561797753, 'fraction_numerical': 0.0, 'mean_word_length': 5.364285714285714, '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}}
An Improved DV Distance Location Algorithm for Wireless Sensor Networks

Aiming at the problem that DV distance location algorithm is greatly influenced by network topology and environment noise, the algorithm is improved from two aspects,. Based on the original algorithm, the improved DV distance algorithm optimizes the selection of location anchor node components in multi hop network by setting collinearity threshold, so that it can better adapt to low density and irregular network, and uses the least square The algorithm is combined with Taylor series expansion to estimate the final position, so as to improve the robustness of the algorithm. Simulation results show that compared with the original algorithm, the improved algorithm has higher positioning accuracy, and still has better positioning performance when the number of anchor nodes is small and the node density is low.