Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.

A Survey on Model-Based Distributed Control and Filtering for Industrial Cyber-Physical Systems

Abstract: Industrial cyber-physical systems (CPSs) are large-scale, geographically dispersed, and life-critical systems, in which lots of sensors and actuators are embedded and networked together to facilitate real-time monitoring and closed-loop control. Their intrinsic features in geographic space and resources put forward to urgent requirements of reliability and scalability for designed filtering or control schemes. This paper presents a review of the state-of-the-art of distributed filtering and control of industrial CPSs described by differential dynamics models. Special attention is paid to sensor networks, manipulators, and power systems. For real-time monitoring, some typical Kalman-based distributed algorithms are summarized and their performances on calculation burden and communication burden, as well as scalability, are discussed in depth. Then, the characteristics of non-Kalman cases are further disclosed in light of constructed filter structures. Furthermore, the latest development is surveyed for distributed cooperative control of mobile manipulators and distributed model predictive control in industrial automation systems. By resorting to droop characteristics, representative distributed control strategies classified by controller structures are systematically summarized for power systems with the requirements of power sharing and voltage and frequency regulation. In addition, distributed security control of industrial CPSs is reviewed when cyber-attacks are taken into consideration. Finally, some challenges are raised to guide the future research.

Distributed fault detection of wireless sensor networks

Abstract: Wireless Sensor Networks (WSNs) have become a new information collection and monitoring solution for a variety of applications. Faults occurring to sensor nodes are common due to the sensor device itself and the harsh environment where the sensor nodes are deployed. In order to ensure the network quality of service it is necessary for the WSN to be able to detect the faults and take actions to avoid further degradation of the service. The goal of this paper is to locate the faulty sensors in the wireless sensor networks. We propose and evaluate a localized fault detection algorithm to identify the faulty sensors. The implementation complexity of the algorithm is low and the probability of correct diagnosis is very high even in the existence of large fault sets. Simulation results show the algorithm can clearly identify the faulty sensors with high accuracy.

Hood: a neighborhood abstraction for sensor networks

Abstract: This paper proposes a neighborhood programming abstraction for sensor networks, wherein a node can identify a subset of nodes around it by a variety of criteria and share state with those nodes. This abstraction allows developers to design distributed algorithms in terms of the neighborhood abstraction itself, instead of decomposing them into component parts such as messaging protocols, data caches, and neighbor lists. In those applications that are already neighborhood-based, this abstraction is shown to facilitate good application design and to reduce algorithmic complexity, inter-component coupling, and total lines of code. The abstraction as defined here has been successfully used to implement several complex applications and is shown to capture the essence of many more existing distributed sensor network algorithms.