On Stability and Convergence of Distributed Filters

Recent years have bore witness to the proliferation of distributed filtering techniques, where a collection of agents communicating over an ad-hoc network aim to collaboratively estimate and track the state of a system. These techniques form the enabling technology of modern multi-agent systems and have gained great importance in the engineering community. Although most distributed filtering techniques come with a set of stability and convergence criteria, the conditions imposed are found to be unnecessarily restrictive. The paradigm of stability and convergence in distributed filtering is revised in this manuscript. Accordingly, a general distributed filter is constructed and its estimation error dynamics is formulated. The conducted analysis demonstrates that conditions for achieving stable filtering operations are the same as those required in the centralized filtering setting. Finally, the concepts are demonstrated in a Kalman filtering framework and validated using simulation examples

Consensus of the Second-order Multi-agent Systems under Asynchronous Switching with a Controller Fault

© 2019, Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag GmbH Germany, part of Springer Nature. Asynchronous switching differing from asynchronous consensus may hinder the system to reach a consensus. This receives very limited attention, especially when the multi-agent systems have a controller fault. In order to analyze the consensus in this situation, this paper studies the consensus of the second-order multi-agent systems under asynchronous switching with a controller fault. We convert the consensus problems under asynchronous switching into stability problems and obtain important results for consensus with the aid of linear matrix inequalities. An example is given to illustrate the effect of asynchronous switching on the consensus, and to validate the analytical results in this paper

A survey of distributed data aggregation algorithms

Distributed data aggregation is an important task, allowing the decentralized determination of meaningful global properties, which can then be used to direct the execution of other applications. The resulting values are derived by the distributed computation of functions like COUNT, SUM, and AVERAGE. Some application examples deal with the determination of the network size, total storage capacity, average load, majorities and many others. In the last decade, many different approaches have been proposed, with different trade-offs in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of aggregation algorithms, it can be difficult and time consuming to determine which techniques will be more appropriate to use in specific settings, justifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally defines the concept of aggregation, characterizing the different types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.info:eu-repo/semantics/publishedVersio

Investigation of the IoT Device Lifetime with Secure Data Transmission

This paper represents the approach for estimation of the lifetime of the IoT end devices. The novelty of this approach is in the taking into account not only the energy consumption for data transmission, but also for ensuring the security by using the encryption algorithms. The results of the study showed the effect of using data encryption during transmission on the device lifetime depending on the key length and the principles of the algorithm used