{'fraction_non_alphanumeric': 0.007423117709437964, 'fraction_numerical': 0.0, 'mean_word_length': 5.647887323943662, '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}}
Decentralized scheduling of sensor network for parameter estimation of distributed systems

An approach to determine a scheduling policy for sensor network monitoring some spatial domain in order to identify unknown parameters of a distributed system is discussed. Given a finite number of possible sites at which sensors may reside the activation schedule for scanning sensors is provided so as to maximize a criterion defined on the Fisher information matrix associated with the estimated parameters. The original combinatorial problem is relaxed through operating on the density of sensors in lieu of individual sensor positions. As a result of adaptation of pairwise communication algorithms a numerical scheme is developed, which distributes the computational burden between the network nodes. The proposed approach is illustrated with simulations on a sensor network scheduling problem for a two-dimensional convective diffusion process.