{'fraction_non_alphanumeric': 0.017277125086385625, 'fraction_numerical': 0.0, 'mean_word_length': 5.033333333333333, '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}}
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This allows to perform an originally complex calculation with high precision on constrained nodes. Besides this advantage, DLS lacks in two harmful constraints concerning practical appliance. On the one hand the algorithm does not scale, i.e. calculation and communication increases with the number of beacon nodes or with network size, respectively. On the other hand DLS even does not work for large networks. An important assumption of DLS is that each blind node can communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. In this work we present an adaptation of DLS, concerning major changes, which enables DLS to be used in large WSNs for the first time. At the same time computational and communicational cost of each node becomes independent from network size, while precision is kept on the same high level.