Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEvent-Triggered Distributed Estimation With Decaying Communication Rate
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study distributed estimation of a high-dimensional static parameter vector through a group of sensors whose communication network is modeled by a fixed directed graph. Different from existing time-triggered communication schemes, an event-triggered asynchronous scheme is investigated in order to reduce communication while preserving estimation convergence. A distributed estimation algorithm with a single step size is first proposed based on an event-triggered communication scheme with a time-dependent decaying threshold. With the event-triggered scheme, each sensor sends its estimate to neighbor sensors only when the difference between the current estimate and the last sent-out estimate is larger than the triggering threshold. We prove that the proposed algorithm has mean-square and almost-sure convergence respectively, under an integrated condition of sensor network topology and sensor measurement matrices. The condition is satisfied if the topology is a balanced digraph containing a spanning tree and the system is collectively observable. Moreover, we provide estimates for the convergence rates, which are related to the step size as well as the triggering threshold. Furthermore, as an essential metric of sensor communication intensity in the event-triggered distributed algorithms, the communication rate is proved to decay to zero with a certain speed almost surely as time goes to infinity. We show that given the step size, adjusting the decay speed of the triggering threshold can lead to a tradeoff between the convergence rate of the estimation error and the decay speed of the communication rate. Specifically, increasing the decay speed of the threshold would make the communication rate decay faster, but reduce the convergence rate of the estimation error. Numerical simulations are provided to illustrate the developed results.
rate research
Read More
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze a distributed averaging algorithm which operates exclusively with quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and rely on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). We characterize the properties of the proposed distributed averaging protocol, illustrate its operation with an example, and show that its execution, on any timeinvariant and strongly connected digraph, will allow all agents to reach, in finite time, a common consensus value that is equal to the quantized average. We conclude with comparisons against existing quantized average consensus algorithms that illustrate the performance and potential advantages of the proposed algorithm.
General nonlinear continuous-time systems are considered for which the state is to be estimated via a packet-based communication network. We assume that the system has multiple sensor nodes, affected by measurement noise, which can transmit output data at discrete (non-equidistant) and asynchronous points in time. For this general system setup, we develop a state estimation framework, where the transmission instances of the individual sensor nodes can be generated in both time-triggered and event-triggered fashions. In the latter case, we guarantee the absence of Zeno behavior by construction. It is shown that, under the provided design conditions, an input-to-state stability property is obtained for the estimation error and that the state is thus reconstructed asymptotically in the absence of noise. A numerical case study shows the strengths of the developed framework.
In this paper, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where some nodes in the network are curious but not malicious and they try to identify the initial states of other nodes based on the data they receive during their operation (without interfering in the computation in any other way), while some nodes in the network want to ensure that their initial states cannot be inferred exactly by the curious nodes. We propose two privacy-preserving event-triggered quantized average consensus algorithms that can be followed by any node wishing to maintain its privacy and not reveal the initial state it contributes to the average computation. Every node in the network (including the curious nodes) is allowed to execute a privacy-preserving algorithm or its underlying average consensus algorithm. Under certain topological conditions, both algorithms allow the nodes who adopt privacypreserving protocols to preserve the privacy of their initial quantized states and at the same time to obtain, after a finite number of steps, the exact average of the initial states.
The emergence of the Internet-of-Things and cyber-physical systems necessitates the coordination of access to limited communication resources in an autonomous and distributed fashion. Herein, the optimal design of a wireless sensing system with n sensors communicating with a fusion center via a collision channel of limited capacity k (k < n) is considered. In particular, it is shown that the problem of minimizing the mean-squared error subject to a threshold-based strategy at the transmitters is quasi-convex. As such, low complexity, numerical optimization methods can be applied. When coordination among sensors is not possible, the performance of the optimal threshold strategy is close to that of a centralized lower bound. The loss due to decentralization is thoroughly characterized. Local communication among sensors (using a sparsely connected graph), enables the on-line learning of unknown parameters of the statistical model. These learned parameters are employed to compute the desired thresholds locally and autonomously. Consensus-based strategies are investigated and analyzed for parameter estimation. One strategy approaches the performance of the decentralized approach with fast convergence and a second strategy approaches the performance of the centralized approach, albeit with slower convergence. A hybrid scheme that combines the best of both approaches is proposed offering a fast convergence and excellent convergent performance.
A graph theoretic framework recently has been proposed to stabilize interconnected multiagent systems in a distributed fashion, while systematically capturing the architectural aspect of cyber-physical systems with separate agent or physical layer and control or cyber layer. Based on that development, in addition to the modeling uncertainties over the agent layer, we consider a scenario where the control layer is subject to the denial of service attacks. We propose a step-by-step procedure to design a control layer that, in the presence of the aforementioned abnormalities, guarantees a level of robustness and resiliency for the final two-layer interconnected multiagent system. The incorporation of an event-triggered strategy further ensures an effective use of the limited energy and communication resources over the control layer. We theoretically prove the resilient, robust, and Zeno-free convergence of all state trajectories to the origin and, via a simulation study, discuss the feasibility of the proposed ideas.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
