{'fraction_non_alphanumeric': 0.025806451612903226, 'fraction_numerical': 0.0, 'mean_word_length': 5.015503875968992, '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}}
Iterative location algorithm based on adaptive grid

How to obtain the unknown nodes' position is an important issue in WSN research fields, in which ranging error and position of beacon nodes' have a great influence on the accuracy of localization. In this paper, an iterative location algorithm based on adaptive grid is proposed. By putting the beacon nodes on the edge of the unknown nodes' distribution area, the cosines theorem of triangle is used to obtain the unknown nodes' coordinates. Then, some optimally located nodes are selected as new beacon nodes (called NBNs). According to these NBNs' coordinates and their communication range, next grid's width or height is calculated. By repeating this iterative process, all the unknown nodes will be located gradually.