{'fraction_non_alphanumeric': 0.01161751563896336, 'fraction_numerical': 0.0, 'mean_word_length': 5.292134831460674, '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}}
Multi-Hop Progressive Decentralized Estimation of Deterministic Vector in Wireless Sensor Networks

This paper presents a novel scheme for estimating an unknown deterministic vector in a multi-hop progressive decentralized fashion in a wireless sensor network. Under this scheme, each sensor performs the best linear unbiased estimation of the unknown vector using the data measured by the sensor and the estimations received from its up stream sensors, and the estimation at each sensor is first quantized and then forwarded to its down stream sensor. The final estimation of the unknown vector resides at a fusion center. The number of quantization bits assigned to each sensor is computed offline via an optimization algorithm that minimizes the network transmission energy subject to a pre-determined upper bound on the mean square error of the final estimation at the fusion center. This optimization algorithm utilizes any given routing tree from all sensors to the fusion center. Comparing to the conventional non-progressive schemes, the proposed progressive scheme yields a significant amount of energy saving.