{'fraction_non_alphanumeric': 0.009250693802035153, 'fraction_numerical': 0.0, 'mean_word_length': 5.3274853801169595, '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}}
Finite Approximate Consensus for Privacy in Distributed Sensor Networks

With concepts such as the Internet of Things becoming more commonplace, greater emphasis must be placed on data privacy in large-scale public networks for these to be used securely without the threat of data theft. Most current distributed processing research deals with improving the flexibility and convergence speed of algorithms for networks of finite size with no constraints on information sharing and no concept for expected levels of signal privacy. In this work we investigate the concept of data privacy in unbounded public networks, where processing approximation is seen as a means to restrict information travel. We describe a practical method to use during processing aggregation stages that may be implemented in hardware to restrict the distance that data is shared. This method is efficient to implement, and requires very few update iterations to perform. We simulate the method and demonstrate its performance for the task of distributed acoustic beamforming in microphone sensor networks.