{'fraction_non_alphanumeric': 0.01646542261251372, 'fraction_numerical': 0.0, 'mean_word_length': 5.039735099337748, '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}}
Adaptive consensus of wireless sensor networks under local measurement by a sink node

In this paper, consensus problem is investigated for a class of discrete-time wireless sensor networks, with which the topologies are connected. Each sensor updates its state that is based on the states of itself and its neighbours, the information that each sensor received is corrupted by additive noise, and data can be gotten by a sink node directly or indirectly. Based on the local measurement among the sink node and its neighbours, an expected state is provided. According to errors among the expected state and the states of all sensors, the adaptive consensus protocols are provided. By Gershgorin's theorem and the Lyapunov functional method, a sufficient condition has been derived to ensure system to achieve the expected value. Simulation results are provided to verify the reliability of the proposed methods.